Submission #1360384

---

Source Code Expand

#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cmath>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <sstream>
#include <string>
#define _repargs(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _repargs(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define mod 1000000007
#define inf 2000000007
#define mp make_pair
#define pb push_back
typedef long long ll;
using namespace std;
template <typename T>
inline void output(T a, int p = 0) {
    if(p) cout << fixed << setprecision(p)  << a << "\n";
    else cout << a << "\n";
}
// end of template

int main() {
    cin.tie(0);
    ios::sync_with_stdio(0);
    // source code
    int N;
    cin >> N;
    vector<int> A(N);
    rep(i, N) cin >> A[i];
    
    int ma = -inf, mi = inf;
    rep(i, N){
        ma = max(ma, A[i]);
        mi = min(mi, A[i]);
    }
    
    if(ma > mi + 1){
        output("No");
    }
    else if(ma > mi){
        int mi_cnt = 0, ma_cnt = 0;
        rep(i, N){
            if(A[i] == mi) mi_cnt++;
            else ma_cnt++;
        }
        if(mi_cnt <= mi && ma_cnt >= (ma - mi_cnt) * 2){
            output("Yes");
        }
        else{
            output("No");
        }
    }
    else{
        if(N == ma + 1 || N >= ma * 2){
            output("Yes");
        }
        else{
            output("No");
        }
    }
    
    return 0;
}

Submission Info

Judge Result