Submission #1042560

---

Source Code Expand

#include <algorithm>
#include <cstdio>
#include <ctype.h>
#include <functional>
#include <iostream>
#include <cassert>
#include <cfloat>
#include <climits>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define int long long
signed main() {
	int res;
	int i, o, t, j, l, s, z;
	cin >> i >> o >> t >> j >> l >> s >> z;
	res = 0;
	res += o;
	res += min(j, l) * 2;
	res += (i/2) * 2;
	res += min((int)abs(j - l) / 2, i / 2);
	if (min(j, l) > 0) {
		if (i % 2 == 1) {
			res += 1;
		}
	}
	cout << res << endl;
	return 0;
}

Submission Info

Judge Result