Submission #1382450


Source Code Expand

#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <cassert>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>

using namespace std;

#define f first
#define s second
#define pb push_back
#define pp pop_back
#define mp make_pair
#define ll long long
#define ld double
#define ull unsigned long long
#define PI pair < int, int > 

const int N = 1e5 + 123;
const int M = 123;
const ld Pi = acos(-1);
const ll Inf = 1e18;
const int inf = 1e9;
const int mod = 1e9 + 7;
const int Sz = 501;
const int MOD = 1e9 + 7;

void add(int &a, int b) {
  a += b;
  if (a >= mod) a -= mod;
}
int mult(int a, int b) {
  return 1ll * a * b % mod;
}
int sum(int a, int b) {
  add(a, b);
  return a;
}

int a[10];
ll ans;

void solve() { 
  for (int i = 0;i < 7;i++) cin >> a[i];
  ans = a[0] / 2 * 4ll + a[1] * 2ll;
  ll now = a[1] * 2ll;
  ll cur = min({a[0], a[3], a[4]});
  now += cur * 6ll;
  now += (a[0] - cur) / 2ll * 4ll;
  ans = max(ans, now);
  cout << ans / 2ll << endl;
}
  
int main() {
  #ifdef wws
   freopen("in", "r", stdin);
   // freopen("in", "w", stdout);
  #endif 
  ios_base::sync_with_stdio(0);
  int tt = 1; 
  while(tt--) solve();
  return 0;
}

Submission Info

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

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 600
Status
AC × 2
AC × 12
WA × 34
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 WA 1 ms 256 KB
1_05.txt AC 1 ms 256 KB
1_06.txt WA 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 WA 1 ms 256 KB
1_13.txt WA 1 ms 256 KB
1_14.txt WA 1 ms 256 KB
1_15.txt WA 1 ms 256 KB
1_16.txt WA 1 ms 256 KB
1_17.txt WA 1 ms 256 KB
1_18.txt WA 1 ms 256 KB
1_19.txt WA 1 ms 256 KB
1_20.txt WA 1 ms 256 KB
1_21.txt WA 1 ms 256 KB
1_22.txt WA 1 ms 256 KB
1_23.txt WA 1 ms 256 KB
1_24.txt WA 1 ms 256 KB
1_25.txt WA 1 ms 256 KB
1_26.txt WA 1 ms 256 KB
1_27.txt WA 1 ms 256 KB
1_28.txt WA 1 ms 256 KB
1_29.txt WA 1 ms 256 KB
1_30.txt WA 1 ms 256 KB
1_31.txt WA 1 ms 256 KB
1_32.txt WA 1 ms 256 KB
1_33.txt WA 1 ms 256 KB
1_34.txt WA 1 ms 256 KB
1_35.txt WA 1 ms 256 KB
1_36.txt WA 1 ms 256 KB
1_37.txt WA 1 ms 256 KB
1_38.txt WA 1 ms 256 KB
1_39.txt WA 1 ms 256 KB
1_40.txt WA 1 ms 256 KB
1_41.txt WA 1 ms 256 KB
1_42.txt WA 1 ms 256 KB
1_43.txt WA 1 ms 256 KB