Submission #1043065
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef vector<int> vi; typedef vector<ll> vl; typedef pair<int,int> pii; typedef pair<ll,ll> pll; typedef int _loop_int; #define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i) #define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i) #define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1;i>=(_loop_int)(a);--i) #define DEBUG(x) cout<<#x<<": "<<x<<endl #define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl #define ALL(a) (a).begin(),(a).end() #define CHMIN(a,b) a=min((a),(b)) #define CHMAX(a,b) a=max((a),(b)) // mod const ll MOD = 1000000007ll; #define FIX(a) ((a)%MOD+MOD)%MOD // floating typedef double Real; const Real EPS = 1e-11; #define EQ0(x) (abs(x)<EPS) #define EQ(a,b) (abs(a-b)<EPS) typedef complex<Real> P; int main(){ int i,o,t,j,l,s,z; cin>>i>>o>>t>>j>>l>>s>>z; ll ans = 0; ans = o; // I J L ll use = i/2; ans += use*2; i -= use*2; use = j/2; ans += use*2; j -= use*2; use = l/2; ans += use*2; l -= use*2; if(i&&j&&l)ans+=3; cout<<ans<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Tetromino Tiling |
User | rickytheta |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1162 Byte |
Status | WA |
Exec Time | 3 ms |
Memory | 384 KB |
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 | 3 ms | 256 KB |
0_01.txt | AC | 3 ms | 256 KB |
1_00.txt | AC | 3 ms | 384 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 | 384 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 | WA | 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 | 256 KB |
1_16.txt | AC | 2 ms | 256 KB |
1_17.txt | AC | 3 ms | 256 KB |
1_18.txt | WA | 3 ms | 256 KB |
1_19.txt | AC | 3 ms | 256 KB |
1_20.txt | WA | 3 ms | 256 KB |
1_21.txt | AC | 3 ms | 256 KB |
1_22.txt | AC | 2 ms | 256 KB |
1_23.txt | WA | 3 ms | 384 KB |
1_24.txt | WA | 3 ms | 256 KB |
1_25.txt | WA | 2 ms | 256 KB |
1_26.txt | WA | 2 ms | 256 KB |
1_27.txt | AC | 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 | AC | 3 ms | 256 KB |
1_34.txt | AC | 2 ms | 256 KB |
1_35.txt | WA | 3 ms | 256 KB |
1_36.txt | AC | 3 ms | 256 KB |
1_37.txt | WA | 2 ms | 256 KB |
1_38.txt | AC | 3 ms | 256 KB |
1_39.txt | AC | 2 ms | 256 KB |
1_40.txt | WA | 3 ms | 256 KB |
1_41.txt | AC | 3 ms | 256 KB |
1_42.txt | AC | 3 ms | 256 KB |
1_43.txt | WA | 2 ms | 256 KB |