1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
| #include <cstdio>
#include <algorithm>
const int N = 1e5, M = 2e5, Log4N = 19;
struct node {
int val, rank, lchild, rchild;
} tree[4 * N + M * Log4N];
int init[N + 1], root[M + 1], tot;
int build(int l, int r) {
int now = ++tot;
if (l == r) {
tree[now].val = init[l];
tree[now].rank = 1;
return now;
}
int mid = l + r >> 1;
tree[now].lchild = build(l, mid);
tree[now].rchild = build(mid + 1, r);
return now;
}
int update(int x, int l, int r, int target, int newroot) {
int now = ++tot;
tree[now] = tree[x];
if (l == r) {
tree[now].val = newroot;
tree[newroot].rank = std::max(tree[newroot].rank, tree[now].rank + 1);
return now;
}
int mid = l + r >> 1;
if (target <= mid)
tree[now].lchild = update(tree[x].lchild, l, mid, target, newroot);
else
tree[now].rchild = update(tree[x].rchild, mid + 1, r, target, newroot);
return now;
}
int query(int x, int l, int r, int target) {
if (l == r) return tree[x].val;
int mid = l + r >> 1;
if (target <= mid)
return query(tree[x].lchild, l, mid, target);
else
return query(tree[x].rchild, mid + 1, r, target);
}
int getroot(int x, int l, int r, int target) {
int ans = query(x, l, r, target);
if (ans == target) return ans;
else return getroot(x, l, r, ans);
}
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
init[i] = i;
root[0] = build(1, n);
int op, a, b, k;
for (int i = 1; i <= m; i++) {
scanf("%d", &op);
if (op == 1) {
scanf("%d%d", &a, &b);
int root_a = getroot(root[i - 1], 1, n, a);
int root_b = getroot(root[i - 1], 1, n, b);
if (tree[root_a].rank < tree[root_b].rank)
root[i] = update(root[i - 1], 1, n, root_a, root_b);
else
root[i] = update(root[i - 1], 1, n, root_b, root_a);
} else if (op == 2) {
scanf("%d", &k);
root[i] = root[k];
} else {
scanf("%d%d", &a, &b);
root[i] = root[i - 1];
printf("%d\n", getroot(root[i], 1, n, a) == getroot(root[i], 1, n, b));
}
}
}
|
