3027

3027 - Corporative Network

思路：并查集；

cost记录当前点到根节点的距离，每次合并时路径压缩将cost更新。

#include<stdio.h>
#include<algorithm>
#include<iostream>
#include<string.h>
#include<math.h>
#include<stack>
#include<set>
#include<queue>
using namespace std;
int   bin[20005];
int   du[20005];
char str[20];
int main(void)
{
        int i,j;
        int n;
        scanf("%d",&n);
        while(n--)
        {
                int m;
                scanf("%d",&m);
                for(i = 1; i <= 20005; i++)
                        bin[i] = i,du[i] = 0;
                while(scanf("%s",str),str[0]!='O')
                {
                        int x,y;
                        if(str[0]=='I')
                        {
                                scanf("%d %d",&x,&y);
                                int xx;
                                for(xx = y; bin[xx]!=xx;)
                                {
                                        xx = bin[xx];
                                        du[y]+=du[xx];
                                }
                                bin[y] = xx;
                                bin[x] = xx;
                                du[x] = du[y]+abs(x-y)%1000;
                        }
                        else
                        {      int sum = 0;
                                int xx;scanf("%d",&x);
                                for(xx = x; bin[xx]!=xx;)
                                {
                                        xx=bin[xx],du[x]+=du[xx];
                                }
                                bin[x] = xx;
                                printf("%d
",du[x]);
                        }
                }
        }
        return 0;
}