Submission #1043078

---

Source Code Expand

#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cmath>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <sstream>
#include <string>
#define _repargs(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _repargs(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define mod 1000000007
#define inf 2000000007
#define mp make_pair
#define pb push_back
typedef long long ll;
using namespace std;
template <typename T>
inline void output(T a, int p = 0) {
    if(p) cout << fixed << setprecision(p)  << a << "\n";
    else cout << a << "\n";
}
// end of template

int main() {
    cin.tie(0);
    ios::sync_with_stdio(0);
    // source code
    vector<ll> A(7);
    rep(i, 7) cin >> A[i];
    
    ll ret = 0;
    ret += A[1];
    ret += (A[0] / 2) * 2;
    ret += (A[3] / 2) * 2;
    ret += (A[4] / 2) * 2;
    if(A[0] % 2 == 1 && A[3] % 2 == 1 && A[4] % 2 == 1) ret += 3;
    ll two = 0;
    two += A[1];
    ll cnt = min(A[0], min(A[3], A[4]));
    two += cnt * 3;
    two += (A[0] - cnt) / 2 * 2;
    two += (A[3] - cnt) / 2 * 2;
    two += (A[4] - cnt) / 2 * 2;
    
    output(max(two, ret));
    
    return 0;
}

Submission Info

Judge Result