Submission #1360823

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <iomanip>
#include <string>
#include <functional>
#include <utility>
#include <queue>
#include <vector>
#include <string>
#include <stack>
#include <cmath>
#define rep(i,n) for(ll i=0;i<n;i++)
using namespace std;
typedef long long int ll;
const ll  MOD = 1000000007;
typedef pair<ll,ll> P;
const ll INF = 100100100100100100;

ll N;
ll a[100100];
int main(){
  cin >> N;
  ll mem = -1;
  rep(i,N){
    ll b;
    cin >> b;
    a[b]++;
  }
  ll cnt = 0;
  ll pa = 0;
  ll pb = 0;
  rep(i,100010){
    if(a[i] > 0){
      cnt++;
      if(cnt == 1){
        pa = i;
      }
      if(cnt == 2){
        pb = i;
      }
    }
  }
  if(cnt > 2) cout << "No" << endl;
  if(cnt == 1){
    ll tmp = a[pa];
    if(tmp == pa+1 || tmp>= 2*pa){
      cout << "Yes" << endl;
    }
    else{
      cout << "No" << endl;
    }
  }
  else if(cnt == 2){
    ll ans = 0;
    ll tmpa = a[pa];
    ll tmpb = a[pb];
    if(tmpa >= pa+1){
      cerr << "aaa" << endl;
      cout << "No" << endl;
    }
    else{
      ans += tmpa;
      ans += (tmpb)/2;
      if(ans < pb){
        cerr << "bbb" << endl;
        cout << "No" << endl;
      }
      else{
        cerr << "ccc" << endl;
        cout << "Yes" << endl;
      }
    }
  }
}

Submission Info

Judge Result