[51nod1515]明辨是非

#include<set>
#include<cmath>
#include<ctime>
#include<queue>
#include<stack>
#include<cstdio>
#include<vector>
#include<cstring>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#define N 200005
using namespace std;
int a[N],f[N],x[N],y[N],p[N],n,m;
set<int> s[N];
set<int>::iterator l;
inline int gf(int k){
    if(f[k]==k) return k;
    return f[k]=gf(f[k]);
}
inline int search(int k){
    int l=1,r=m,mid;
    while(l<r){
        mid=(l+r)>>1;
        if(a[mid]<k) l=mid+1;
        else r=mid;
    }
    return l;
}
inline void init(){
    scanf("%d",&n);
    for(int i=1;i<=n;++i){
        scanf("%d%d%d",&x[i],&y[i],&p[i]);
        a[++m]=x[i];a[++m]=y[i];
    }
    sort(a+1,a+1+m);
    for(int i=1;i<=n;++i){
        x[i]=search(x[i]);
        y[i]=search(y[i]);
    }
    for(int i=1;i<=m;++i) f[i]=i;
    for(int i=1,j,k,q;i<=n;++i){
        j=gf(f[x[i]]);k=gf(f[y[i]]);
        if(!p[i]){
            if(j==k) puts("NO");
            else{
                puts("YES");
                s[j].insert(k);
                s[k].insert(j);
            }
        }
        else{
            if(j==k) puts("YES");
            else if(s[j].count(k)||s[k].count(j)) puts("NO");
            else{
                puts("YES");
                if(s[j].size()>s[k].size()){
                    q=j;j=k;k=q;
                }
                f[j]=k;
                for(l=s[j].begin();l!=s[j].end();++l){
                    q=gf(*l);
                    s[*l].erase(j);
                    s[q].insert(k);
                    s[k].insert(q);
                }
                s[j].clear();
            }
        }
    }
}
int main(){
    freopen("judge.in","r",stdin);
    freopen("judge.out","w",stdout);
    init();
    fclose(stdin);
    fclose(stdout);
    return 0;
}