题意:有n个数进行,操作,'I'操作把a和b连接起来,而且a和b的距离即|a-b|%1000;'E'操作进行查询那个数到根节点的距离和;'O'操作结束。
因为题目只查询结点到根结点的距离,故可用并查集,如果记录每个节点到根的距离,那么每次I操作都要更新很多节点的信息,时间复杂度难以保证,因此考虑记下每个结点到父结点的距离,然后在路径压缩时维护这个d数组
代码如下
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<vector>
#include<map>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<set>
using namespace std;
#define LL long long
const int maxn = 20000 + 10;
const int INF = 1000000000;
//freopen("input.txt", "r", stdin);
int pa[maxn], d[maxn];
int findset(int x) {
if(x != pa[x]) {
int root = findset(pa[x]);
d[x] += d[pa[x]];
return pa[x] = root;
}
else return x;
}
int main() {
int T; scanf("%d", &T);
while(T--) {
int n, u, v;
char cmd[9];
scanf("%d", &n);
for(int i = 1; i <= n; i++) { pa[i] = i; d[i] = 0; }
while(scanf("%s", cmd) && cmd[0] != 'O') {
if(cmd[0] == 'E') { scanf("%d", &u); findset(u); printf("%d", d[u]); }
if(cmd[0] == 'I') { scanf("%d%d", &u, &v); pa[u] = findset(u); d[u] = abs(u - v) % 1000; }
}
}
return 0;
}