LA 3027并查集

3027 - Corporative Network Time limit: 3.000 seconds

#include<cstdio>
#include<iostream>
#include<algorithm>

using namespace std;
const int maxn=20050;
int pre[maxn];
int d[maxn];

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

int main(){
   int T;
   scanf("%d",&T);
   while(T--){
      int n,u,v;
      char cmd;
      scanf("%d",&n);
      for(int i=1;i<=n;i++){
           pre[i]=i;
           d[i]=0;
      }
      while(scanf("%c",&cmd)&&cmd!='o'){
           if(cmd=='E'){
                scanf("%d",&u);
                find(u);
                printf("%d\n",d[u]);
           }
           if(cmd=='I'){
              scanf("%d%d",&u,&v);
              pre[u]=v;
              d[u]=abs(u-v)%1000;
           }
      }
   }
   return 0;
}