Submission #1307656

---

Source Code Expand

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

#define DUMP(x) cerr << #x << "=" << x << endl
#define DUMP2(x, y) cerr<<"("<<#x<<", "<<#y<<") = ("<<x<<", "<<y<<")"<< endl
#define BINARY(x) static_cast<bitset<16> >(x)

#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define REP(i,m,n) for (int i=m;i<(int)(n);i++)

#define in_range(x, y, w, h) (0<=(int)(x) && (int)(x)<(int)(w) && 0<=(int)(y) && (int)(y)<(int)(h))
#define ALL(a) (a).begin(),(a).end()

typedef long long ll;
const int INF   = 1e9;
const ll  INFLL = 1e18;
typedef pair<int, int> PII;
int dx[4]={0, -1, 1, 0}, dy[4]={-1, 0, 0, 1};

ll solve(ll O, ll I, ll J, ll L)
{
    ll ans = 2 * O;
    ans += 4 * (I / 2); I %= 2;
    ans += 4 * (J / 2); J %= 2;
    ans += 4 * (L / 2); L %= 2;
    return ans;
}

int main()
{
    ios::sync_with_stdio(false);

    ll I, O, T, J, L, S, Z;
    cin >> I >> O >> T >> J >> L >> S >> Z;

    ll ans = solve(O, I, J, L);
    if (I > 0 && J > 0 && L > 0) {
        ans = max(ans, solve(O, I-1, J-1, L-1) + 6);
    }

    cout << ans / 2 << endl;
}

Submission Info

Judge Result