题目:https://icpcarchive.ecs.baylor.edu/external/30/3027.pdf
详见注释:
int n,pre[maxn],d[maxn];
void init()
{
for(int i=1;i<=n;i++)
pre[i]=i,d[i]=0;
}
inline void merge()
{
int x,y;
scanf("%d%d",&x,&y);
pre[x]=y;
d[x]=abs(y-x)%1000;
}
int find(int x)
{
if(x==pre[x]) return x;
int root=find(pre[x]);
d[x]+=d[pre[x]];
/*这个我半天也想不出来,主要有两个地方:
1.利用递归的性质,就是先把后面的部分处理完。
(递推型的DP是先把前面的处理完,而这里的这个性质和记忆化搜索一样)
2.预处理,添加一个结点时, d[x]=abs(y-x)%1000;这样方便了后面的递归。
*/
return pre[x]=root;
}
inline void query()
{
int x;scanf("%d",&x);
find(x);
printf("%d\n",d[x]);
}
int main()
{
int T;scanf("%d",&T);
char op;
while(T--)
{
scanf("%d",&n);
init();
while(~scanf(" %c",&op)&&op!='O')
{
if(op=='E') query();
else merge();
}
}
return 0;
}
#include<cstdio>
#include<string>
#include<cstring>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<climits>
#include<queue>
#include<vector>
#include<map>
#include<sstream>
#include<set>
#include<stack>
#include<cctype>
#include<utility>
#pragma comment(linker, "/STACK:102400000,102400000")
#define PI 3.1415926535897932384626
#define eps 1e-10
#define sqr(x) ((x)*(x))
#define FOR0(i,n) for(int i=0 ;i<(n) ;i++)
#define FOR1(i,n) for(int i=1 ;i<=(n) ;i++)
#define FORD(i,n) for(int i=(n) ;i>=0 ;i--)
#define lson num<<1,le,mid
#define rson num<<1|1,mid+1,ri
#define MID int mid=(le+ri)>>1
#define zero(x)((x>0? x:-x)<1e-15)
#define mk make_pair
#define _f first
#define _s second
using namespace std;
//const int INF= ;
typedef long long ll;
//const ll inf =1000000000000000;//1e15;
//ifstream fin("input.txt");
//ofstream fout("output.txt");
//fin.close();
//fout.close();
//freopen("a.in","r",stdin);
//freopen("a.out","w",stdout);
const int INF =0x3f3f3f3f;
const int maxn= 20000+10 ;
//const int maxm= ;
//by yskysker123