Submission #1041743
Source Code Expand
#include <cstdio> #include <cstdlib> #include <cstring> #include <algorithm> #include <vector> #include <string> #include <cmath> #include <queue> #include <set> #include <map> #include <functional> using namespace std; typedef long long int ll; typedef pair <int,int> P; int main() { ll a,b,c,d,e,f,g; scanf("%lld %lld %lld %lld %lld %lld %lld",&a,&b,&c,&d,&e,&f,&g); //I : a , J : d , L : e ll ret=(a/2)*2LL+(d/2)*2LL+(e/2)*2LL; if(a>=1&&d>=1&&e>=1) ret=max(ret,3LL+((a-1)/2)*2LL+((d-1)/2)*2LL+((e-1)/2)*2LL); printf("%lld\n",ret+b); return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Tetromino Tiling |
User | yutaka1999 |
Language | C++14 (GCC 5.4.1) |
Score | 600 |
Code Size | 583 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 128 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:20:66: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%lld %lld %lld %lld %lld %lld %lld",&a,&b,&c,&d,&e,&f,&g); ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 600 / 600 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 0_00.txt, 0_01.txt |
All | 0_00.txt, 0_01.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt, 1_27.txt, 1_28.txt, 1_29.txt, 1_30.txt, 1_31.txt, 1_32.txt, 1_33.txt, 1_34.txt, 1_35.txt, 1_36.txt, 1_37.txt, 1_38.txt, 1_39.txt, 1_40.txt, 1_41.txt, 1_42.txt, 1_43.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_00.txt | AC | 1 ms | 128 KB |
0_01.txt | AC | 1 ms | 128 KB |
1_00.txt | AC | 1 ms | 128 KB |
1_01.txt | AC | 1 ms | 128 KB |
1_02.txt | AC | 1 ms | 128 KB |
1_03.txt | AC | 1 ms | 128 KB |
1_04.txt | AC | 1 ms | 128 KB |
1_05.txt | AC | 1 ms | 128 KB |
1_06.txt | AC | 1 ms | 128 KB |
1_07.txt | AC | 1 ms | 128 KB |
1_08.txt | AC | 1 ms | 128 KB |
1_09.txt | AC | 1 ms | 128 KB |
1_10.txt | AC | 1 ms | 128 KB |
1_11.txt | AC | 1 ms | 128 KB |
1_12.txt | AC | 1 ms | 128 KB |
1_13.txt | AC | 1 ms | 128 KB |
1_14.txt | AC | 1 ms | 128 KB |
1_15.txt | AC | 1 ms | 128 KB |
1_16.txt | AC | 1 ms | 128 KB |
1_17.txt | AC | 1 ms | 128 KB |
1_18.txt | AC | 1 ms | 128 KB |
1_19.txt | AC | 1 ms | 128 KB |
1_20.txt | AC | 1 ms | 128 KB |
1_21.txt | AC | 1 ms | 128 KB |
1_22.txt | AC | 1 ms | 128 KB |
1_23.txt | AC | 1 ms | 128 KB |
1_24.txt | AC | 1 ms | 128 KB |
1_25.txt | AC | 1 ms | 128 KB |
1_26.txt | AC | 1 ms | 128 KB |
1_27.txt | AC | 1 ms | 128 KB |
1_28.txt | AC | 1 ms | 128 KB |
1_29.txt | AC | 1 ms | 128 KB |
1_30.txt | AC | 1 ms | 128 KB |
1_31.txt | AC | 1 ms | 128 KB |
1_32.txt | AC | 1 ms | 128 KB |
1_33.txt | AC | 1 ms | 128 KB |
1_34.txt | AC | 1 ms | 128 KB |
1_35.txt | AC | 1 ms | 128 KB |
1_36.txt | AC | 1 ms | 128 KB |
1_37.txt | AC | 1 ms | 128 KB |
1_38.txt | AC | 1 ms | 128 KB |
1_39.txt | AC | 1 ms | 128 KB |
1_40.txt | AC | 1 ms | 128 KB |
1_41.txt | AC | 1 ms | 128 KB |
1_42.txt | AC | 1 ms | 128 KB |
1_43.txt | AC | 1 ms | 128 KB |