bzoj4195 [Noi2015]程序自动分析(八中OJ牛逼)

https://www.lydsy.com/JudgeOnline/problem.php?id=4195

/*niupi*/

#include <bits/stdc++.h>
#define debug(x) cerr<<#x<<"="<<x<<endl
using namespace std;
#define pb push_back
#define int long long 
const double pi=acos(-1.0);
const int mod=1e8+7;
const int maxn=1e6+5;

int a[maxn],b[maxn],c[maxn],mp[maxn<<1],fa[maxn<<1];
int n,m,num;
bool ok;
void init(){
    memset(a,0,sizeof(a));
    memset(b,0,sizeof(b));
    memset(c,0,sizeof(c));
    n=m=num=0;
    ok=0;
}

int get(int x){
    if(fa[x]==x)return x;
    return fa[x]=get(fa[x]);
}

void unite(int x,int y){
    x=get(x),y=get(y);
    if(x!=y)fa[y]=x;
}

signed main(){
    //ios::sync_with_stdio(false);
    //int a,b;
    
    int t;cin>>t;
    while(t--){
        init();
        int n;cin>>n;
        for(int i=1;i<=n;i++){
            cin>>a[i]>>b[i]>>c[i];
            mp[++num]=a[i];mp[++num]=b[i];
        }
        
        sort(mp+1,mp+num+1);
        
        for(int i=1;i<=num;i++)fa[i]=i;
        
        for(int i=1;i<=n;i++){
            if(c[i]==1){// a[i]==b[i]
                int x=lower_bound(mp+1,mp+1+num,a[i])-mp;//>=
                int y=lower_bound(mp+1,mp+1+num,b[i])-mp;
                
                int u=get(x),v=get(y);
                
                if(u!=v)fa[v]=x;
            }
        }
        
        for(int i=1;i<=n;i++){
            if(c[i]==0){
                int x=lower_bound(mp+1,mp+1+num,a[i])-mp;
                int y=lower_bound(mp+1,mp+1+num,b[i])-mp;
                
                int u=get(x),v=get(y);
                
                if(u==v){
                    ok=1;
                    break;
                }
            }
        }
        if(ok)cout<<"NO"<<endl;
        else cout<<"YES"<<endl;
    }
    

    return 0;
}