Submission #1360819

---

Source Code Expand

#include<bits/stdc++.h>

using namespace std;

int N, A[100000];

bool check(int A_0)
{
  int kind1 = 0;
  for(int i = 0; i < N; i++) {
    if(A[i] == A_0) ++kind1;
  }
  int kind2 = N - kind1;
  if(A_0 < kind1 - 1 + (kind2 != 0)) return (false);
  int sz = A_0 + 1 - kind1;
  while(sz > 0 && kind2 > 1) {
    sz--;
    kind2 -= 2;
  }
  if(sz == 0) return (true);
  return (false);
}

int main()
{
  cin >> N;
  for(int i = 0; i < N; i++) cin >> A[i];
  sort(A, A + N);
  if(abs(A[0] != A[N - 1]) > 2) cout << "No" << endl;
  else if(check(A[0])) cout << "Yes" << endl;
  else if(count(A, A + N, A[0]) == N && check(A[0] - 1)) cout << "Yes" << endl;
  else cout << "No" << endl;
}

Submission Info

Judge Result