Submission #4044375

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <string>
#include <cmath>
#include <iomanip>
#include <numeric>
#include <cmath>
#include <set>

using namespace std;

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
#define INF (ll)1e18
#define MOD (ll)1e9 + 7
#define pb push_back

typedef long long ll;
typedef long long int llt;
typedef pair<int, int> P;
typedef vector<int> V;
typedef map<int, int> M;

char dif = 'A' - 'a';

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
	ll n, a[112345];
	cin >> n;
	rep(i, n) cin >> a[i];
	bool two = false;
	ll sum = 0;
	for (ll i = 1; i < n;i++){
		if(a[i]==2)
			two = true;
			if(two==false&&a[i]>2){
				if(a[i]%2==0)
					sum += a[i] / 2 - 1;
					else
						sum += a[i] / 2;
			}
			if(two==true&&a[i]>2){
				if(a[i]%3==0)
					sum += a[i] / 3 - 1;
					else
						sum += a[i] / 3;
			}
	}
	ll plus;
	if(a[0]>1)
		plus = a[0] - 1;
		else
			plus = 0;
		cout << sum + plus << endl;
		return 0;
}

Submission Info

Judge Result