bzoj 4195程序自动分析

先离散一下，然后并查集就好了。

（一开始作大死，没全离散，WA一片）

 #include<bits/stdc++.h>
 #define INF 0x7fffffff
 #define LL long long
 #define N 1000005
 using namespace std;
 inline int ra()
 {
     int x=,f=; char ch=getchar();
     while (ch<'' || ch>'') {if (ch=='-') f=-; ch=getchar();}
     while (ch>='' && ch<='') {x=x*+ch-''; ch=getchar();}
     return x*f;
 }
 int fa[N],b[N],n,m,cnt,tot,sum;
 bool flag;
 struct node{
     int x,y;
 }ask[N],a[N];
 int find(int x)
 {
     return fa[x]==x?x:fa[x]=find(fa[x]);
 }
 int main()
 {
     int T=ra();
     while (T--)
     {
         map<int ,int > mp; sum=;
         n=ra(); cnt=; tot=; flag=;
         for (int i=; i<=n; i++)
         {
             int x=ra(),y=ra(),z=ra();
             if (z==)
                 {
                     b[++sum]=x; b[++sum]=y;
                     ask[++cnt].x=x,ask[cnt].y=y;
                 }
             else {
                 a[++tot].x=x; a[tot].y=y;
                 b[++sum]=x; b[++sum]=y;
             }
         }
         sort(b+,b+sum+);
         int len=unique(b+,b+sum+)-b;
         unique(b+,b+sum+);
         for (int i=; i<len; i++)
             mp[b[i]]=i;
         for (int i=; i<=sum; i++) fa[i]=i;
         for (int i=; i<=tot; i++)
         {
             int q=find(mp[a[i].x]),p=find(mp[a[i].y]);
             if (q!=p)
                 fa[p]=q;
         }
         for (int i=; i<=cnt; i++)
         {
             int q=find(mp[ask[i].x]),p=find(mp[ask[i].y]);
             if (p==q)
             {
                 cout<<"NO"<<endl;
                 flag=;
                 break;
             }
         }
         if (!flag) cout<<"YES"<<endl;
     }
     return ;
 }