题意:
题目链接:https://vjudge.net/problem/UVA-11987
对集合三种操作,一种合并,一种求集合元素个数和总和,另一种是将其中一个集合的元素移动到另一个集合,输出询问个数和总和。
思路:
并查集,主要是转移这个操作,如果单纯将pa[x]=Find(y),那么以x为祖先的结点都会被转移,因此这里需要为每个集合设置虚拟节点,所有集合的根一定都是虚拟节点,所有操作也都针对虚拟节点来进行,即可解决问题。
代码:
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 10;
int pa[MAXN], sz[MAXN], sum[MAXN];
int Find(int x) {
return pa[x] == x ? x : pa[x] = Find(pa[x]);
}
void Unit(int x, int y) {
int px = Find(x), py = Find(y);
if (px != py) {
pa[px] = py;
sz[py] += sz[px];
sum[py] += sum[px];
}
}
int main() {
//freopen("in.txt", "r", stdin);
int n, m;
while (scanf("%d%d", &n, &m) == 2) {
for (int i = 1; i <= n; i++) {
pa[i] = i + n;
sz[i] = 1;
sum[i] = i;
}
for (int i = n + 1; i <= 2 * n; i++) {
pa[i] = i;
sz[i] = 1;
sum[i] = i - n;
}
for (int i = 1; i <= m; i++) {
int op, x, y;
scanf("%d", &op);
if (op == 1) {
scanf("%d%d", &x, &y);
Unit(x, y);
}
else if (op == 2) {
scanf("%d%d", &x, &y);
int px = Find(x), py = Find(y);
//if (px == py) continue;
pa[x] = py;
sz[px]--; sum[px] -= x;
sz[py]++; sum[py] += x;
}
else {
scanf("%d", &x);
int px = Find(x);
printf("%d %d\n", sz[px], sum[px]);
}
}
}
return 0;
}