Submission #1831897


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define repr(i,n) for(int i=(int)(n-1);i>=0;i--)
#define rep(i,n) repl(i,0,n)
#define each(itr,v) for(auto itr:v)
#define pb(s) push_back(s)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout << #x" = " << x << endl
#define print(x) cout << x << endl
#define maxch(x,y) x=max(x,y)
#define minch(x,y) x=min(x,y)
#define uni(x) x.erase(unique(all(x)),x.end())
#define exist(x,y) (find(all(x),y)!=x.end())
#define bcnt(x) bitset<32>(x).count()

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<P, int> PPI;
typedef pair<int, P> PIP;
typedef pair<ll, ll> PL;
typedef pair<P, ll> PPL;
typedef set<int> S;

#define INF INT_MAX/3
#define MAX_N 1000000001


int main(){
    cin.sync_with_stdio(false);
    ll i, o, t, j, l, s, z;
    cin >> i >> o >> t >> j >> l >> s >> z;

    ll yoko = o;
    if ((i % 2 && j % 2) || (j % 2 && l % 2) || (i % 2 && l % 2)) {
        yoko += 3;
        i--, j--, l--;
    }
    yoko += (i / 2) * 2 + (j / 2) * 2 + (l / 2) * 2;
    cout << yoko << endl;
    return 0;
}

Submission Info

Submission Time
Task C - Tetromino Tiling
User zura
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1226 Byte
Status WA
Exec Time 2 ms
Memory 384 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 600
Status
AC × 2
AC × 43
WA × 3
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 384 KB
0_01.txt AC 1 ms 256 KB
1_00.txt AC 1 ms 256 KB
1_01.txt AC 1 ms 256 KB
1_02.txt AC 1 ms 256 KB
1_03.txt AC 1 ms 256 KB
1_04.txt AC 1 ms 256 KB
1_05.txt AC 1 ms 256 KB
1_06.txt AC 1 ms 256 KB
1_07.txt WA 1 ms 256 KB
1_08.txt WA 1 ms 256 KB
1_09.txt WA 1 ms 256 KB
1_10.txt AC 1 ms 256 KB
1_11.txt AC 1 ms 256 KB
1_12.txt AC 1 ms 256 KB
1_13.txt AC 1 ms 256 KB
1_14.txt AC 1 ms 256 KB
1_15.txt AC 1 ms 256 KB
1_16.txt AC 1 ms 256 KB
1_17.txt AC 1 ms 256 KB
1_18.txt AC 1 ms 256 KB
1_19.txt AC 1 ms 256 KB
1_20.txt AC 1 ms 256 KB
1_21.txt AC 1 ms 256 KB
1_22.txt AC 1 ms 256 KB
1_23.txt AC 1 ms 256 KB
1_24.txt AC 1 ms 256 KB
1_25.txt AC 1 ms 256 KB
1_26.txt AC 1 ms 256 KB
1_27.txt AC 1 ms 256 KB
1_28.txt AC 1 ms 256 KB
1_29.txt AC 1 ms 256 KB
1_30.txt AC 1 ms 256 KB
1_31.txt AC 1 ms 256 KB
1_32.txt AC 1 ms 256 KB
1_33.txt AC 1 ms 256 KB
1_34.txt AC 1 ms 256 KB
1_35.txt AC 1 ms 256 KB
1_36.txt AC 1 ms 256 KB
1_37.txt AC 1 ms 256 KB
1_38.txt AC 1 ms 256 KB
1_39.txt AC 1 ms 256 KB
1_40.txt AC 1 ms 256 KB
1_41.txt AC 1 ms 256 KB
1_42.txt AC 1 ms 256 KB
1_43.txt AC 1 ms 256 KB