NOI2015 程序自动分析 prog

何等水题

某神犇仿关押罪犯的写法 却写挂了  然而实际上并不需要补集之类的

 #include<iostream>
 #include<cstring>
 #include<cstdlib>
 #include<cstdio>
 #include<algorithm>

 using namespace std; 

 const int Maxn=;
 int n;
 struct Data{
     int x,y;
     Data(int x=,int y=):x(x),y(y) {}
 }q[Maxn][];
 int tot[];
 int seq[Maxn*];
 int hash(int x) {
     return lower_bound(seq+,seq+n*+,x) - seq;
 }
 int fa[Maxn*];
 int find(int x) {
     return fa[x]==x?x:fa[x]=find(fa[x]);
 }
 bool merge(int x,int y) {
     x=find(x);
     y=find(y);
     if(x==y) return ;
     return fa[x]=y,;
 }

 void init() {
     tot[]=tot[]=;
     scanf("%d",&n);
     for(int i=;i<=n*;i++) fa[i]=i;
     int x,y,e;
     for(int i=;i<=n;i++) {
         scanf("%d%d%d",&x,&y,&e);
         seq[i*-]=x;
         seq[i*]=y;
         q[++tot[e]][e] = Data(x,y);
     }
     sort(seq+,seq+n*+);
 }

 bool check() {
     for(int i=;i<=tot[];i++) {
         merge(hash(q[i][].x),hash(q[i][].y));
     }
     for(int i=;i<=tot[];i++) {
         int x=hash(q[i][].x),y=hash(q[i][].y);
         if(find(x)==find(y)) return ;
     }
     return ;
 }

 int main() {
     freopen("prog.in","r",stdin);
     freopen("prog.out","w",stdout);

     int T;
     for(scanf("%d",&T);T--;) {
         init();
         if(check())puts("YES");
         else puts("NO");
     }

     return ;
 }