种类并查集

判断是否存在两个属于一集合却又关系

#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <string.h>
using namespace std;
const int MAXN=2010;
int F[MAXN];
int val[MAXN];
int find(int x)
{
    if(F[x]==-1)return x;
    int tmp=find(F[x]);
    val[x]+=val[F[x]];
    val[x]%=2;
    return F[x]=tmp;
}
int main()
{
    int T;
    int n,m;
    scanf("%d",&T);
    int iCase=0;
    while(T--)
    {
        iCase++;
        memset(F,-1,sizeof(F));
        memset(val,0,sizeof(val));
        scanf("%d%d",&n,&m);
        bool flag=true;
        int u,v;
        while(m--)
        {
            scanf("%d%d",&u,&v);
            if(!flag)continue;
            int t1=find(u),t2=find(v);
            if(t1==t2)
            {
                if(val[u]==val[v])flag=false;
            }
            else
            {
                F[t1]=t2;
                val[t1]=val[v]-val[u]+1;
                val[t1]%=2;
            }
        }
        if(flag)printf("NO\n\n",iCase);
        else printf("YES\n\n",iCase);
    }
    return 0;
}