Submission #7397910

---

Source Code Expand

#include "bits/stdc++.h"
using namespace std;

int main() {
    int n;
    cin >> n;
    int m = 1 << n;
    vector<int> s(m);
    for(int i = 0; i < m; i++) cin >> s[i];
    sort(s.begin(), s.end(), greater<int>());
    int index = 1;
    int mi = s[0];
    int minnum = 1;
    for(int i = 1; i <= n; i++){
        int count = 0;
        int next = mi;
        int nextnum = 0;
        while(index < (1<<i)){
            if(mi == s[index]){
                count++;
            }
            if(next > s[index]){
                nextnum = 1;
                next = s[index];
            }else if(next == s[index]){
                nextnum++;
            }
            index++;
        }
        if(minnum + count > ((1<<i)) - (1<<(i-1))){
            cout << "No" << endl;
            return 0;
        }
        mi = next;
        minnum = nextnum;
    }
    cout << "Yes" << endl;
}

Submission Info

Judge Result