种类并查集

POJ-1182

#include <iostream>
#include <cstdio>
#include<cstring>
using namespace std;
const int  N = 50005;
int f[N],rankk[N];//同类0 x吃祖先1  x被祖先吃2
int n,k;
void Init()
{
    for(int i = 0;i <= n;i++)
    {
        f[i] = i;
        rankk[i] = 0;
    }
}
int getf(int x)
{
    if(x== f[x])
        return x;
    int fa = f[x];
    f[x] = getf(f[x]);
    rankk[x] = (rankk[x]+rankk[fa]) % 3;
    return f[x];
}

bool merge(int x,int y,int type)
{
    int fx,fy;
    fx=getf(x);
    fy=getf(y);
    if(fx==fy)
    {
        if((rankk[y]-rankk[x]+3)%3!=type)
            return true;
        return false;
    }
    else
    {
        f[fy]=fx;
        rankk[fy]=(rankk[x]-rankk[y]+type+3)%3;
        return false;
    }
}

int main()
{

    scanf("%d%d",&n,&k);
    Init();
    int d,x,y;
    int sum=0;
    for(int i=0;i<k;i++)
    {
        scanf("%d%d%d",&d,&x,&y);
        if(x>n || y>n ||(x==y && d==2))
            sum++;
        else if(merge(x,y,d-1))
            sum++;
    }
    printf("%d\n",sum);
    return 0;
}

POJ-2492

#include <iostream>
#include <cstdio>
#include<cstring>

const int N = 2005;
int f[N],rank[N];

void Init(int n)
{
    for(int i = 0;i <= n;i++)
    {
        rank[i] = 1;
        f[i] = i;
    }
}
int getf(int t)
{
    if(t == f[t])
        return t;
    else
    {
        int fa = f[t];
        f[t] = getf(f[t]);
        rank[t] = (rank[t] + rank[fa] + 1) % 2;
        return f[t];
    }
}

void merge(int a,int b)
{
    int fa = getf(a);
    int fb = getf(b);
    f[fa] = fb;
    rank[fa] = (rank[b] - rank[a]) % 2;
}

int main()
{
    int t,n,m,a,b;
    scanf("%d",&t);
    for(int ca = 1;ca <= t;ca++)
    {
        scanf("%d%d",&n,&m);
        Init(n);
        bool flag = true;
        while(m--)
        {
            scanf("%d%d",&a,&b);
            if(getf(a) == getf(b))
            {
                if(rank[a] == rank[b])
                    flag = false;
            }
            else
                merge(a,b);
        }
        printf("Scenario #%d:\n",ca);
        if(flag)
            printf("No suspicious bugs found!\n\n");
        else
            printf("Suspicious bugs found!\n\n");
    }
    return 0;
}

HDU-3038

#include<iostream>
#include<cstdio>


const int N = 200005;

int f[N],rank[N],ans;

void Init(int n)
{
    ans = 0;
    for(int i = 0;i <= n;i++)
    {
        f[i] = i;
        rank[i] = 0;
    }
}

int getf(int t)
{
    if(t == f[t])
        return t;
    else
    {
        int fa = f[t];
        f[t] = getf(f[t]);
        rank[t] += rank[fa];
        return f[t];
    }
}

void merge(int u,int v,int k)
{
    int fu = getf(u);
    int fv = getf(v);
    if(fu == fv)
    {
        if(rank[v] - rank[u] != k)
            ans++;
    }
    else
    {
        f[fv] = fu;
        rank[fv] = rank[u]-rank[v]+k;
    }
}
int main()
{
    int n,m,x,y,val;
    while(~scanf("%d%d",&n,&m))
    {
        Init(n);
        while(m--)
        {
            scanf("%d%d%d",&x,&y,&val);
            merge(x-1,y,val);
        }
        printf("%d\n",ans);
    }
    return 0;
}