G: Placing Medals on a Binary Tree

CSUOJ 2297: Placing Medals on a Binary Tree
Gym - 101158G Placing Medals on a Binary Tree

#include <iostream>
#include <iomanip>
#include <stdio.h>
#include <string.h>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <cctype>
#include <sstream>
#define LL long long
#define LD long double
#define ULL unsigned long long
#define UI unsigned int
#define _for(i,j,k) for(int i=j;i<=k;i++)
#define for_(i,j,k) for(int i=j;i>=k;i--)
#define lowbit(x) (x&-x)
#define ls(x) x<<1
#define rs(x) x<<1|1
//#pragma comment(linker, "/STACK:10240000000,10240000000")
using namespace std;
const int maxn = 5e5+5;
set<int> se;
int n,num,ma,ta[maxn],k,an;
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    cin>>n;
    _for(i,1,n){
        cin>>ta[i];
        ma=max(ma,ta[i]);
    }
    k=ma;
    _for(i,1,n){
        num=ma-ta[i];
        if(num==k&&se.size()==ma-k&&k!=ma){
            cout<<"Yes\n";
            k=-2;
            continue;
        }
        if(num>=k){
            cout<<"No\n";
            continue;
        }
        if(!se.count(num)) se.insert(num);
        else{
            while(se.count(num)){
                se.erase(num);
                num++;
            }
            se.insert(num);
        }
        while(se.count(k-1)) k--;
        cout<<"Yes\n";
    }
    return 0;
}