Submission #1386824

---

Source Code Expand

// Nurbakyt Madibek
// Look at my code! IT'S AWESOME

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

using namespace std;

#define pb push_back
#define pp pop_back
#define f first
#define s second
#define mp make_pair
#define sz(a) (int)((a).size())
#ifdef _WIN32
#  define I64 "%I64d"
#else
#  define I64 "%lld"
#endif
#define fname "."

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair < int, int > pi;
typedef pair < int, ull > pu;
typedef pair < ll, ll > pl;

const int inf = (int)1e9 + 123;
const ll infl = (ll)1e18 + 123;
const double eps = 1e-9;

const int MAX_N = (int)1e5 + 5;
const int mod = (int)1e9 + 7;

ll a[10];

int main() {
#ifdef DEBUG
    freopen("input.txt", "r", stdin);
#endif
    for (int i = 0; i < 7; i++)
        cin >> a[i];
    
    ll res = 0ll + a[1] + a[0] / 2 * 2 + a[3] / 2 * 2 + a[4] / 2 * 2;
    if (a[0] % 2 == 1 && a[3] % 2 == 1 && a[4] % 2 == 1)
        res += 3;
    
    ll res2 = a[1];
    if (a[0] > 0 && a[3] > 0 && a[4] > 0) {
        res2 += 3;
        a[0]--, a[3]--, a[4]--;
    }
    
    res2 += 0ll + a[0] / 2 * 2 + a[3] / 2 * 2 + a[4] / 2 * 2;
    
    cout << max(res, res2) << endl;
    return 0;
}

Submission Info

Judge Result