Submission #2126162

---

Source Code Expand

#include <bits/stdc++.h>

#define rep(i,n) for(int i=0; i<(n); i++)
#define reps(i,x,n) for(int i=x; i<(n); i++)
#define rrep(i,n) for(int i=(n)-1; i>=0; i--)
#define all(X) (X).begin(),(X).end()
#define X first
#define Y second
#define pb push_back
#define eb emplace_back

using namespace std;
typedef long long int ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }

template<class A, size_t N, class T> void Fill(A (&a)[N], const T &v){ fill( (T*)a, (T*)(a+N), v ); }

template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {os<<"{"; rep(i,t.size()) {os<<t[i]<<",";} os<<"}"; return os;}
template<class T,size_t n> ostream& operator<<(ostream &os, const array<T,n> &t) {os<<"{"; rep(i,n) {os<<t[i]<<",";} os<<"}"; return os;}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}

const ll INF = 1e9+7;


ll way0(){
}

int main(){
	//ios_base::sync_with_stdio(false);
	ll I, O, T, J, L, S, Z;
	ll ans = 0;

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

	ans += O;
	if( (I%2) + (J%2) + (L%2) >= 2 && I > 0 && J > 0 && L > 0 ){
		I--;
		J--;
		L--;
		ans += 3;
	}
	ans += (I/2) * 2;
	ans += (J/2) * 2;
	ans += (L/2) * 2;

	cout << ans << endl;

	return 0;
}

Submission Info

Judge Result