Bzoj 3674: 可持久化并查集加强版

传送门： http://www.lydsy.com/JudgeOnline/problem.php?id=3674
题面： $n$ 个集合 $m$ 个操作
操作：
$1\ a\ b$ 合并 $a,b$ 所在集合
$2\ k$ 回到第 $k$ 次操作之后的状态(查询算作操作)
$3\ a\ b$ 询问 $a,b$ 是否属于同一集合，是则输出 $1$ 否则输出 $0$
请注意本题采用强制在线，所给的 $a,b,k$ 均经过加密,加密方法为 $x = x\ xor\ lastans$ , $lastans$ 的初始值为 $0$ , $0<n,m\le2\times10^5$
题解： 相当于可持久化 $fa$ 数组，要按秩合并，顺便维护 $size$ ，听题面说可以路径压缩，但我不知道路径压缩复杂度怎么证明，然后就没敢写。指针写法失败N发

#include<bits/stdc++.h>
const int M = 2e5 + 10;
const int Size = M * 40;
template <typename T> void read(T &x) {
    x = 0; char c = getchar();
    for (; !isdigit(c); c = getchar());
    for (; isdigit(c); c = getchar()) x = x * 10 + c - '0';
}
struct Node{
    int f, size, lc, rc;
}rec[Size];
int root[M], cnt;
int n, m, op, k, x, y, szx, szy, ans;
void build(int i, int l, int r) {
    if (l == r) {rec[i].f = l; rec[i].size = 1; return;}
    build(rec[i].lc = ++cnt, l, (l + r) / 2);
    build(rec[i].rc = ++cnt, (l + r) / 2 + 1, r);
}
int qry(int i, int l, int r, int x, int op) {
    if (l == r) return !op ? rec[i].f : rec[i].size;
    int mid = (l + r) >> 1;
    return x <= mid ? qry(rec[i].lc, l, mid, x, op) : qry(rec[i].rc, mid + 1, r, x, op);
}
int chg(int last, int l, int r, int x, int c, int op) {
    int ret = ++cnt;
    rec[ret] = rec[last];
    if (l == r) {if (!op) rec[ret].f = c; else rec[ret].size = c; return ret;}
    int mid = (l + r) >> 1;
    if (x <= mid)
        rec[ret].lc = chg(rec[last].lc, l, mid, x, c, op);
    else
        rec[ret].rc = chg(rec[last].rc, mid + 1, r, x, c, op);
    return ret;
}
int find(int x, int i) {
    int f = qry(root[i], 1, n, x, 0);
    return f == x ? x : find(f, i);
}
int main() {
    //fprintf(stderr, "%.6f\n", sizeof(rec) * 1.0 / 1024 / 1024);
    read(n); read(m);
    build(root[0] = ++cnt, 1, n);
    for (int i = 1; i <= m; i++) {
        read(op);
        root[i] = ++cnt;
        if (op == 2) {read(k); k ^= ans; rec[root[i]] = rec[root[k]]; continue;}
        rec[root[i]] = rec[root[i - 1]];
        read(x); x ^= ans; x = find(x, i);
        read(y); y ^= ans; y = find(y, i);
        if (op == 3) {printf("%d\n", ans = (x == y)); continue;}
        szx = qry(root[i], 1, n, x, 1);
        szy = qry(root[i], 1, n, y, 1);
        if (szx < szy) std::swap(x, y), std::swap(szx, szy);
        root[i] = chg(root[i], 1, n, y, x, 0);
        root[i] = chg(root[i], 1, n, x, szx + szy, 1);
    }
    return 0;
}