秋实大哥打游戏

Time Limit: 1 Sec  Memory Limit: 256 MB

题目连接

http://acm.uestc.edu.cn/#/contest/show/59

Description

Input

Output

Sample Input

Sample Output

HINT

题意

题解：

简简单单的带权并查集

//qscqesze
#include <cstdio>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <set>
#include <vector>
#include <sstream>
#include <queue>
#include <typeinfo>
#include <fstream>
#include <map>
typedef long long ll;
using namespace std;
//freopen("D.in","r",stdin);
//freopen("D.out","w",stdout);
#define sspeed ios_base::sync_with_stdio(0);cin.tie(0)
#define maxn 100010
int mod=1000;
#define eps 1e-9
//const int inf=0x7fffffff;   //无限大
const int inf=0x3f3f3f3f;
/*
inline ll read()
{int x=0,f=1;char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}return x*f;
}
int buf[10];
inline void write(int i) {int p = 0;if(i == 0) p++;else while(i) {buf[p++] = i % 10;i /= 10;}for(int j = p-1; j >=0; j--) putchar('0' + buf[j]);printf("\n");
}
*/
//**************************************************************************************
int p[maxn];
long long w[maxn];int fi(int x)
{if(p[x]==x) return x;else{fi(p[x]);w[x]+=w[p[x]];p[x]=fi(p[x]);}return p[x];
}
bool un(int a,int b)
{int x=fi(a);int y=fi(b);if(x==y) return false;p[a]=y;w[a]=abs(a-b)%1000+w[b];return true;
}
int main()
{int n,x,y;scanf("%d",&n);for(int i=0;i<=n;i++){p[i]=i;w[i]=0;}char a[100];while(scanf("%s",&a)!=EOF){if(a[0]=='O')break;if(a[0]=='E'){scanf("%d",&x);fi(x);printf("%lld\n",w[x]);}else{scanf("%d%d",&x,&y);un(x,y);}}return 0;
}