Submission #2861161

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <map>
#include <stack>
#include <queue>
#include <set>
#include <cstring>

using namespace std;
// ascending order
#define vsort(v) sort(v.begin(), v.end())
// descending order
#define vsort_r(v) sort(v.begin(), v.end(), greater<int>())
// ascending order
#define asort(array, N) sort(array, array + N)
// descending order
#define asort_r(array, N) sort(array, array + N, greater<int>())
#define vunique(v) v.erase(unique(v.begin(), v.end()), v.end())
#define mp make_pair
#define ts(x) to_string(x)
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1e18;

ll N;
vector<ll> A;
vector<ll> even;
vector<ll> odd;

bool check() {
	int count = 0;
	for(int i = 0; i < A.size(); i++) {
		if(A[i] > 0) count++;
	}
	if(count == 1) return true;
	return false;
}

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	cin >> N;
	for(int i = 0; i < N; i++) {
		int a;
		cin >> a;
		A.push_back(a);
	}
	int i = 1;
	int count = 0;
	while(!check()){
		if(count == A.size() - 1 || i >= A.size()) {
			cout << "NO" << endl;
			return 0;
		}
		if(A[0] % 2 != A[i] % 2) i++;
		else if(A[i] > 0){
			A[0] += A[i];
			A[i] = -1;
			i = 1;
			count++;
		} else i++;
	}
	cout << "YES" << endl;

}

Submission Info

Judge Result