Submission #1043066

---

Source Code Expand

#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <cassert>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <bitset>
#include <functional>
#include <numeric>
using namespace std;

#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define mp(a,b) make_pair((a),(b))
#define pb(a) push_back((a))
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<((x))<<endl
#define fi first
#define se second

#define INF 2147483600
#define long long long

int main(){
  int i,o,t,j,l,s,z;
  cin>>i>>o>>t>>j>>l>>s>>z;

  long k=o;
  long tmp = min(l,min(i,j));
  k += tmp*3;
  k += ((l-tmp)/2 + (i-tmp)/2 + (j-tmp)/2)*2;

  long p=o;
  long tp = min(l,min(i,j))-1;
  p += tp*3;
  p += ((l-tp)/2 + (i-tp)/2 + (j-tp)/2)*2;

  cout << max(k,p) << endl;

  return 0;
}

Submission Info

Judge Result