HDU 5820 Lights （主席树）

#include<bits/stdc++.h>
using namespace std;
#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long
#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define fi first                                  
#define se second
#define mk(x,y) make_pair(x,y)
const int mod=1e9+7;
const int maxn=5e4+10;
const int maxm=5e5+10;
const ll INF=1e18;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){
    if(y==0) return x;
    return gcd(y,x%y);
}
int n,ans=1,ub,lb,mp[maxn],gy[maxn],pre;
int root[maxm],tot=0,cur=0,ch[maxm*30][2],val[maxm*30];
vector<int> gx[maxn];
void update(int old,int &now,int l,int r,int pos){
    now=++tot;
    ch[now][0]=ch[old][0];
    ch[now][1]=ch[old][1];
    val[now]=val[old]+1;
    if(l==r) return ;
    int mid=l+r>>1;
    if(pos<=mid) update(ch[old][0],ch[now][0],l,mid,pos);
    if(mid<pos) update(ch[old][1],ch[now][1],mid+1,r,pos);
}
int query(int rt,int l,int r,int L,int R){
    if(rt==0) return 0;
    if(L>R) return 0;
    if(L<=l&&r<=R) return val[rt];
    int mid=l+r>>1,ans=0;
    if(L<=mid) ans+=query(ch[rt][0],l,mid,L,R);
    if(mid<R) ans+=query(ch[rt][1],mid+1,r,L,R);
    return ans;
}
int f(int x){
    return mp[gy[x]];
}
int judge1(int x){
    rep(i,0,gx[x].size()){
        int t1=gx[x][i],t2=(i?gx[x][i-1]:0);
        if(query(root[f(t1)],1,ub,t2+1,t1-1)^query(root[cur],1,ub,t2+1,t1-1))
            return 0;
    }
    return 1;
}
int judge2(int x){
    int sz=gx[x].size()-1;
    for(int i=sz;i>=0;i--){
        int t1=gx[x][i],t2=(i==sz?ub+1:gx[x][i+1]);
        if(query(root[f(t1)],1,ub,t1+1,t2-1)^query(root[cur],1,ub,t1+1,t2-1))
            return 0;
    }
    return 1;
}

int main(){/*
    freopen("input.txt","r",stdin);
    freopen("output.txt","w",stdout);*/
    ios::sync_with_stdio(false);
    while(cin>>n&&n){
        lb=maxm,cur=tot=ub=0;
        rep(i,0,maxn) gx[i].clear();
        mst(gy,0),mst(mp,0);
        while(n--){
            int x,y;
            cin>>x>>y;
            gx[x].push_back(y);
            ub=max(ub,y),lb=min(lb,x);
        }
        int ans=1;
        rep(i,lb,maxn){
            if(!gx[i].size()) continue;
            sort(gx[i].begin(),gx[i].end());
            unique(gx[i].begin(),gx[i].end());
            if(!judge1(i)||!judge2(i)){
                ans=0;
                break;
            }
            rep(j,0,gx[i].size()){
                cur++;///注意，当初就是这里wA的
                update(root[cur-1],root[cur],1,ub,gx[i][j]);
                gy[gx[i][j]]=pre=i;
            }
            mp[i]=cur;
        }
        if(ans) cout<<"YES\n";
        else cout<<"NO\n";
    }
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long
#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define fi first                                  
#define se second
#define mk(x,y) make_pair(x,y)
const int mod=1e9+7;
const int maxn=5e4+10;
const int maxm=5e5+10;
const ll INF=1e18;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){
    if(y==0) return x;
    return gcd(y,x%y);
}
int n,ans=1,ub,lb,mp[maxn],gy[maxn],pre;
int root[maxm],tot=0,cur=0,ch[maxm*30][2],val[maxm*30];
vector<int> gx[maxn];
void update(int old,int &now,int l,int r,int pos){
    now=++tot;
    ch[now][0]=ch[old][0];
    ch[now][1]=ch[old][1];
    val[now]=val[old]+1;
    if(l==r) return ;
    int mid=l+r>>1;
    if(pos<=mid) update(ch[old][0],ch[now][0],l,mid,pos);
    if(mid<pos) update(ch[old][1],ch[now][1],mid+1,r,pos);
}
int query(int rt,int l,int r,int L,int R){
    if(rt==0) return 0;
    if(L>R) return 0;
    if(L<=l&&r<=R) return val[rt];
    int mid=l+r>>1,ans=0;
    if(L<=mid) ans+=query(ch[rt][0],l,mid,L,R);
    if(mid<R) ans+=query(ch[rt][1],mid+1,r,L,R);
    return ans;
}
int f(int x){
    return gy[x];
}
int judge1(int x){
    rep(i,0,gx[x].size()){
        int t1=gx[x][i],t2=(i?gx[x][i-1]:0);
        if(query(root[f(t1)],1,ub,t2+1,t1-1)^query(root[pre],1,ub,t2+1,t1-1))
            return 0;
    }
    return 1;
}
int judge2(int x){
    int sz=gx[x].size()-1;
    for(int i=sz;i>=0;i--){
        int t1=gx[x][i],t2=(i==sz?ub+1:gx[x][i+1]);
        if(query(root[f(t1)],1,ub,t1+1,t2-1)^query(root[pre],1,ub,t1+1,t2-1))
            return 0;
    }
    return 1;
}

int main(){/*
    freopen("input.txt","r",stdin);
    freopen("output.txt","w",stdout);*/
    ios::sync_with_stdio(false);
    while(cin>>n&&n){
        lb=maxm,cur=tot=ub=0;
        rep(i,0,maxn) gx[i].clear();
        mst(gy,0);
        while(n--){
            int x,y;
            cin>>x>>y;
            gx[x].push_back(y);
            ub=max(ub,y),lb=min(lb,x);
        }
        int ans=1;pre=0;
        rep(i,lb,maxn){
            if(!gx[i].size()) continue;
            sort(gx[i].begin(),gx[i].end());
            unique(gx[i].begin(),gx[i].end());
            if(!judge1(i)||!judge2(i)){
                ans=0;
                break;
            }
            rep(j,0,gx[i].size()){
                update(root[pre],root[i],1,ub,gx[i][j]);
                gy[gx[i][j]]=pre=i;
            }
        }
        if(ans) cout<<"YES\n";
        else cout<<"NO\n";
    }
    return 0;
}