poj 1962 带权并查集

注意路径压缩时的权值合并

View Code

#include<cstdio>
#include<cstring>
#include<stdlib.h>
const int MAX = 20010;
int p[MAX],w[MAX];
void init(int n)
{
    for(int i=0;i<=n;i++)
    {
        p[i]=i;
        w[i]=0;
    }
}
void unio(int x,int y)
{
    p[x]=y;
    w[x]=(abs(x-y)%1000);
}
int find(int x)
{
    if(p[x]==x) return x;
    else
    {
        find(p[x]);w[x]+=w[p[x]];
        p[x]=find(p[x]);
    }
}
int main()
{
    int t,n,x,y;
    char ch;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        init(n);
        getchar();
        while(scanf("%c",&ch)&&ch!='O')
        {
            if(ch=='E')
            {
                scanf("%d",&x);
                find(x);
                printf("%d\n",w[x]);
            }
            else 
            {
                scanf("%d%d",&x,&y);
                unio(x,y);
            }
            getchar();
        }
    }
    return 0;
}