Submission #1499276


Source Code Expand

#include <iostream>
#include <array>
#define repeat(i,n) for (int i = 0; (i) < int(n); ++(i))
typedef long long ll;
using namespace std;
template <class T> void setmax(T & a, T const & b) { if (a < b) a = b; }
/*
 *  OO  IIII  Jjjj  lllL
 *  OO  iiii  JJJj  lLLL
 *
 *  L IIII LLL
 *  LLL iiii L
 *
 *  L IIII J
 *  LLL  JJJ
 */
enum tile_t { I, O, T, J, L, S, Z };
ll f(array<ll, 7> a, int jil) {
    a[I] -= jil;
    a[J] -= jil;
    a[L] -= jil;
    if (a[I] < 0 or a[J] < 0 or a[L] < 0) return -1;
    ll k = 0;
    k += jil * 3;
    k += a[I] / 2 * 2; a[I] %= 2;
    k += a[J] / 2 * 2; a[J] %= 2;
    k += a[L] / 2 * 2; a[L] %= 2;
    k += a[O]; a[O] = 0;
    return k;
}
int main() {
    array<ll, 7> a; repeat (i,7) cin >> a[i];
    ll k = 0;
    repeat (jil,3) setmax(k, f(a, jil));
    cout << k << endl;
    return 0;
}

Submission Info

Submission Time
Task C - Tetromino Tiling
User kimiyuki
Language C++14 (GCC 5.4.1)
Score 600
Code Size 865 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 600 / 600
Status
AC × 2
AC × 46
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 1 ms 256 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 AC 1 ms 256 KB
1_08.txt AC 1 ms 256 KB
1_09.txt AC 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