Submission #3000126


Source Code Expand

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

#define NDEBUG
#ifdef DEBUG
#include "../cout11.h"
#undef NDEBUG
#endif
#include <cassert>

typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;

#define sz(a)  int((a).size())
#define pb  push_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define cons make_pair


ll solve(vi& a) {
    ll ans = 0;

    ll I = a[0], O = a[1], J = a[3], L = a[4];
    ll dI = I/2, dJ = J/2, dL = L/2;
    I %= 2; J %= 2; L %= 2;

    ans += O*2 + 4*dI + 4*dJ + 4*dL;
    if (I && J && L) ans += 6;

    return ans/2;
}

int main() {
    vi a(7);
    rep(i,7) cin >> a[i];
    cout << solve(a) << endl;
    return 0;
}

Submission Info

Submission Time
Task C - Tetromino Tiling
User naoya_t
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1574 Byte
Status
Exec Time 1 ms
Memory 256 KB

Test Cases

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