LOJ#2129. 「NOI2015」程序自动分析

$n leq 1000000$个相等或不等关系描述一些变量，问能否成立，多组数据。

走错片场？普及题误入noi

//#include<iostream>
#include<cstring>
#include<cstdio>
//#include<math.h>
//#include<set>
//#include<queue>
//#include<bitset>
//#include<vector>
#include<algorithm>
#include<stdlib.h>
using namespace std;

#define LL long long
int qread()
{
    char c; int s=0,f=1; while ((c=getchar())<'0' || c>'9') (c=='-') && (f=-1);
    do s=s*10+c-'0'; while ((c=getchar())>='0' && c<='9'); return s*f;
}

//Pay attention to '-' , LL and double of qread!!!!

int T,n;
#define maxn 2000011
int ufs[maxn];
int find(int x) {return x==ufs[x]?x:(ufs[x]=find(ufs[x]));}
void Union(int x,int y) {x=find(x); y=find(y); if (x!=y) ufs[x]=y;}

#define maxh 1000007
struct Hash
{
    struct Edge{int v,id,next;}edge[maxh]; int first[maxh],le;
    void clear() {memset(first,0,sizeof(first)); le=1;}
    int insert(int x)
    {
        int h=x%maxh;
        for (int i=first[h];i;i=edge[i].next) if (edge[i].v==x) return edge[i].id;
        Edge &e=edge[le]; e.v=x; e.id=le; e.next=first[h]; first[h]=le++;
        return le-1;
    }
}h;

struct Node{int x,y;}eee[maxn]; int le=0;
int main()
{
    T=qread();
    while (T--)
    {
        n=qread();
        int op,x,y; h.clear(); le=0;
        for (int i=1;i<=n+n;i++) ufs[i]=i;
        for (int i=1;i<=n;i++)
        {
            x=qread(); y=qread(); op=qread();
            x=h.insert(x); y=h.insert(y);
            if (!op) eee[++le]=(Node){x,y};
            else Union(x,y);
        }
        bool flag=1;
        for (int i=1;i<=le;i++) if (find(eee[i].x)==find(eee[i].y)) flag=0;
        if (flag) puts("YES"); else puts("NO");
    }
    return 0;
}