Submission #1042545
Source Code Expand
#include <cstdio> #include <cstdlib> #include <cstring> #include <iostream> #include <algorithm> typedef long long ll; #define rep(i, a, b) for (int i = a; i <= b; ++ i) #define per(i, a, b) for (int i = a; i >= b; -- i) const int maxn = 100010; using namespace std; int I, O, L; int main() { scanf("%d%d%d%d%d", &I, &O, &L, &L, &L); int ret = O; ret += I / 2 * 2; if (I % 2 && L >= 2) ret += 3, L -= 2; ret += L / 2 * 2; printf("%d", ret); return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Tetromino Tiling |
User | mjy0724 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 480 Byte |
Status | WA |
Exec Time | 3 ms |
Memory | 384 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:13:41: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d%d%d%d", &I, &O, &L, &L, &L); ^
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | 2 ms | 256 KB |
0_01.txt | AC | 3 ms | 256 KB |
1_00.txt | AC | 3 ms | 256 KB |
1_01.txt | AC | 3 ms | 256 KB |
1_02.txt | AC | 3 ms | 256 KB |
1_03.txt | AC | 3 ms | 256 KB |
1_04.txt | WA | 3 ms | 256 KB |
1_05.txt | AC | 3 ms | 256 KB |
1_06.txt | AC | 3 ms | 256 KB |
1_07.txt | AC | 3 ms | 256 KB |
1_08.txt | AC | 3 ms | 256 KB |
1_09.txt | AC | 3 ms | 256 KB |
1_10.txt | WA | 3 ms | 256 KB |
1_11.txt | WA | 3 ms | 256 KB |
1_12.txt | WA | 3 ms | 256 KB |
1_13.txt | WA | 3 ms | 256 KB |
1_14.txt | WA | 3 ms | 384 KB |
1_15.txt | WA | 3 ms | 256 KB |
1_16.txt | WA | 3 ms | 256 KB |
1_17.txt | WA | 2 ms | 256 KB |
1_18.txt | WA | 2 ms | 256 KB |
1_19.txt | WA | 3 ms | 256 KB |
1_20.txt | WA | 2 ms | 256 KB |
1_21.txt | WA | 2 ms | 256 KB |
1_22.txt | WA | 3 ms | 256 KB |
1_23.txt | WA | 3 ms | 256 KB |
1_24.txt | WA | 2 ms | 256 KB |
1_25.txt | WA | 2 ms | 256 KB |
1_26.txt | WA | 3 ms | 256 KB |
1_27.txt | WA | 3 ms | 256 KB |
1_28.txt | WA | 3 ms | 256 KB |
1_29.txt | WA | 3 ms | 256 KB |
1_30.txt | WA | 3 ms | 256 KB |
1_31.txt | WA | 3 ms | 256 KB |
1_32.txt | WA | 3 ms | 256 KB |
1_33.txt | WA | 3 ms | 256 KB |
1_34.txt | WA | 3 ms | 256 KB |
1_35.txt | WA | 2 ms | 256 KB |
1_36.txt | WA | 2 ms | 256 KB |
1_37.txt | WA | 3 ms | 256 KB |
1_38.txt | WA | 3 ms | 256 KB |
1_39.txt | WA | 3 ms | 256 KB |
1_40.txt | WA | 3 ms | 256 KB |
1_41.txt | WA | 2 ms | 256 KB |
1_42.txt | WA | 3 ms | 256 KB |
1_43.txt | WA | 2 ms | 256 KB |