bzoj3673 bzoj3674可持久化并查集

并查集都写不来了qwq

之前写的是错的

sz的初值都是0，这样怎么加就都是0了，水这道题还是可以，但是加强版就过不了了

 #include<cstdio>
 #include<cstring>
 #include<cstdlib>
 #include<algorithm>
 #include<iostream>

 using namespace std;

 template<typename Q> Q &read(Q &x) {
     static char c, f;
     for(f = ; c = getchar(), !isdigit(c); ) if(c == '-') f = ;
     for(x = ; isdigit(c); c = getchar()) x = x *  + c - '';
     if(f) x = -x; return x;
 }
 template<typename Q> Q read() {
     static Q x; read(x); return x;
 }

 const int N =  + ;

 struct Node *newnode(int, Node *, Node *);

 struct Node {
     int v;
     Node *ch[];
     int query(int l, int r, int k) {
         if(l == r) return v;
         int mid = (l + r) >> ;
         if(k <= mid) return ch[]->query(l, mid, k);
         else return ch[]->query(mid + , r, k);
     }
     Node *modify(int l, int r, int k, int w) {
         if(l == r) return newnode(w, , );
         int mid = (l + r) >> ;
         if(k <= mid) return newnode(, ch[]->modify(l, mid, k, w), ch[]);
         return newnode(, ch[], ch[]->modify(mid + , r, k, w));
     }
 }pool[N * ], *pis = pool;

 Node *newnode(int v, Node *lc, Node *rc) {
     pis->v = v, pis->ch[] = lc, pis->ch[] = rc;
     return pis++;
 }

 int n, now;

 struct parr {
     Node *root[N];
     int vt;
     void init(int w) {
         root[] = newnode(w, pis, pis);
     }
     int get(int k, int h) const {
         return root[h]->query(, n, k);
     }
     void modify(int k, int w) {
         root[vt] = root[vt]->modify(, n, k, w);
     }
     void newver(int h) {
         root[++vt] = root[h];
     }
 } sz, fa;

 int find(int x) {
     int y;
     while(x)
         y = x, x = fa.get(x, now);
     return y;
 }

 void unite(int x, int y) {
     sz.newver(now), fa.newver(now);
     x = find(x), y = find(y);
     if(x == y) return;
     int sx = sz.get(x, now), sy = sz.get(y, now);
     if(sx < sy) swap(x, y), swap(sx, sy);
     fa.modify(y, x);
     sz.modify(x, sx + sy);
     now = sz.vt;
 }

 int version[N];
 int main() {
 #ifdef DEBUG
     freopen("in.txt", "r", stdin);
 #endif

     sz.init(), fa.init();
     int m, ans = ; read(n), read(m);
     for(int i = ; i <= m; i++) {
         int opt = read<int>();
         if(opt == ) {
             int u, v; read(u) ^= ans, read(v) ^= ans;
             unite(u, v);
         } else if(opt == ) {
             int h; read(h) ^= ans;
             now = version[h];
         } else if(opt == ) {
             int u, v; read(u) ^= ans, read(v) ^= ans;
             printf("%d\n", ans = find(u) == find(v));
         }
         version[i] = now;
     }

     return ;
 }