Submission #1364595

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>
#include <unordered_map>
#include <unordered_set>
#include <cmath>
#include <cstdio>
#include <map>
#include <set>
#include <utility>
#include <string>
#include <functional>
#include <queue>
#include <stack>

using namespace std;

typedef long long ll;
typedef long double ld;


int main() {
    ios_base::sync_with_stdio(false);
	int n;
	cin >> n;
	vector<int> arr(n);
	int i;
	for(i = 0; i < n; i++) {
		cin >> arr[i];
	}
	sort(arr.begin(), arr.end());
	bool poss = false;
	if(arr[n - 1] - arr[0] <= 1) {	
		if(arr[0] == arr[n - 1]) {
			if(arr[0] == n - 1) {
				poss = true;
			}
			else {
				poss = (n >= 2 * arr[0]);
			}
		}
		else {
			int c1 = 0, c2 = 0;
			for(i = 0; i < n; i++) {
				if(arr[i] == arr[0]) {
					c1++;
				}
				else {
					c2++;
				}
			}
			//int col_left = arr[n - 1] - c1;
			poss = (c2 >= 2) && (c1 == arr[0]);
		}
	}
	if(poss) {
		cout << "Yes";
	}
	else {
		cout << "No";
	}
	cout << endl;		
    return 0;
}

Submission Info

Judge Result