la3027

并查集路径压缩动态记录唯一父节点边权，更新与根结点的距离

#include<bits/stdc++.h>
using namespace std;
const int maxn=50000;
int pa[maxn],d[maxn],n;
void init()
{
    for(int i=1;i<=n;++i)
        pa[i]=i,d[i]=0;
}
int findset(int x)
{
    if(pa[x]!=x)
    {
        int root=findset(pa[x]);
        d[x]+=d[pa[x]];
        return pa[x]=root;
    }
    else return x;
}
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        int u,v;
        scanf("%d",&n);
        char ss[9];
        init();
        while((scanf("%s",ss))&&ss[0]!='O')
        {
            scanf("%d",&u);
            if(ss[0]=='E')
            {
                findset(u);
                printf("%d\n",d[u]);
            }
            else {
                scanf("%d",&v);
                pa[u]=v,d[u]=abs(u-v)%1000;
            }
        }
    }
    return 0;
}