Submission #1042819
Source Code Expand
#include <algorithm> #include <cassert> #include <cfloat> #include <climits> #include <cmath> #include <cstdio> #include <cstdlib> #include <deque> #include <iomanip> #include <iostream> #include <limits> #include <map> #include <queue> #include <set> #include <sstream> #include <stack> #include <string> #include <tuple> #include <vector> #define FOR(i,k,n) for (int (i)=(k); (i)<(n); ++(i)) #define rep(i,n) FOR(i,0,n) #define pb push_back #define all(v) begin(v), end(v) #define debug(x) cerr<< #x <<": "<<x<<endl #define debug2(x,y) cerr<< #x <<": "<< x <<", "<< #y <<": "<< y <<endl using namespace std; typedef long long ll; typedef unsigned long long ull; typedef pair<int, int> pii; typedef vector<int> vi; typedef vector<vector<int> > vvi; typedef vector<ll> vll; typedef vector<vector<ll> > vvll; template<class T> using vv=vector<vector< T > >; int main() { vll a_input(7); rep (i, 7) { scanf("%lld", &a_input[i]); } ll ai, ao, aj, al; ai = a_input[0]; ao = a_input[1]; aj = a_input[3]; al = a_input[4]; ll ans = 0; ans += ao; ans += (ai / 2 * 2); ans += (aj / 2 * 2); ans += (al / 2 * 2); if (ai == 0 || aj == 0 || al == 0) { printf("%lld\n", ans); return 0; } ll ans2 = 0; ans2 += ao; ans2 += 3; ans2 += ((ai-1) / 2 * 2); ans2 += ((aj-1) / 2 * 2); ans2 += ((al-1) / 2 * 2); printf("%lld\n", max(ans, ans2)); return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Tetromino Tiling |
User | tspcx |
Language | C++14 (Clang 3.8.0) |
Score | 600 |
Code Size | 1468 Byte |
Status | AC |
Exec Time | 5 ms |
Memory | 888 KB |
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 | 5 ms | 888 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 | AC | 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 | AC | 3 ms | 256 KB |
1_11.txt | AC | 3 ms | 256 KB |
1_12.txt | AC | 3 ms | 256 KB |
1_13.txt | AC | 3 ms | 256 KB |
1_14.txt | AC | 3 ms | 256 KB |
1_15.txt | AC | 3 ms | 384 KB |
1_16.txt | AC | 3 ms | 256 KB |
1_17.txt | AC | 3 ms | 256 KB |
1_18.txt | AC | 3 ms | 256 KB |
1_19.txt | AC | 3 ms | 256 KB |
1_20.txt | AC | 3 ms | 256 KB |
1_21.txt | AC | 3 ms | 256 KB |
1_22.txt | AC | 3 ms | 256 KB |
1_23.txt | AC | 3 ms | 256 KB |
1_24.txt | AC | 3 ms | 256 KB |
1_25.txt | AC | 3 ms | 256 KB |
1_26.txt | AC | 3 ms | 256 KB |
1_27.txt | AC | 3 ms | 256 KB |
1_28.txt | AC | 3 ms | 256 KB |
1_29.txt | AC | 3 ms | 256 KB |
1_30.txt | AC | 3 ms | 256 KB |
1_31.txt | AC | 3 ms | 256 KB |
1_32.txt | AC | 3 ms | 256 KB |
1_33.txt | AC | 3 ms | 256 KB |
1_34.txt | AC | 3 ms | 256 KB |
1_35.txt | AC | 3 ms | 256 KB |
1_36.txt | AC | 3 ms | 256 KB |
1_37.txt | AC | 3 ms | 256 KB |
1_38.txt | AC | 3 ms | 256 KB |
1_39.txt | AC | 3 ms | 256 KB |
1_40.txt | AC | 3 ms | 256 KB |
1_41.txt | AC | 3 ms | 256 KB |
1_42.txt | AC | 3 ms | 256 KB |
1_43.txt | AC | 3 ms | 256 KB |