LA 并查集路径压缩

#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
using namespace std;

const int maxn=20010;
int f[maxn],d[maxn];

int findset(int x)
{
    if(f[x] !=x)
    {
        int root=findset(f[x]);
        d[x]+=d[f[x]];
        return f[x]=root;
    }
    else return x;
}

int main()
{
    int T,i,n,u,v;
    char c[5];
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d",&n);
        for(i=1;i<=n;i++){ f[i]=i;d[i]=0;}
        while(scanf("%s",c) && c[0]!=‘O‘)
        {  
            if(c[0] == ‘E‘)
            {
                scanf("%d",&u);
                findset(u);
                printf("%d\n",d[u]);
            }
            if(c[0] == ‘I‘)
            {
                scanf("%d %d",&u,&v);
                f[u]=v;d[u]=abs(u-v)%1000;
            }
          
        }
    }
    return 0;
}