3673: 可持久化并查集 by zky

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<ext/rope>
using namespace std;
using namespace __gnu_cxx;
const int MAXN=2000050;
const int maxn=0x7fffffff;
void read(int &n)
{
    char c=‘+‘;int x=0;bool flag=0;
    while(c<‘0‘||c>‘9‘){c=getchar();if(c==‘-‘)flag=1;}
    while(c>=‘0‘&&c<=‘9‘){x=x*10+(c-48);c=getchar();}
    flag==1?n=-x:n=x;
}

rope<int> *rp[MAXN];
int a[MAXN];
int n,m,how,x,y,lastans;
int find(int i,int x)
{
	if(rp[i]->at(x)==x) 	return x;
	int f=find(i,rp[i]->at(x));
	if(f==rp[i]->at(x))		return f;
	rp[i]->replace(x,f);
	return f;
}
void merge(int i,int x,int y)
{
	x=find(i,x),y=find(i,y);
	if(x!=y)	rp[i]->replace(y,x);
}
int main()
{
    int n,m;
    read(n);read(m);
    for(int i=1;i<=n;i++)	a[i]=i;
	rp[0]=new rope<int> (a,a+n+1);
	for(int i=1;i<=m;i++)
	{
		rp[i]=new rope<int> (*rp[i-1]);
		int how;read(how);
		if(how==1)
		{
			read(x);read(y);
			merge(i,x^lastans,y^lastans);
		}
		else if(how==2)
		{
			read(x);
			rp[i]=rp[x^lastans];
		}
		else if(how==3)
		{
			read(x);read(y);
			printf("%d\n",(find(i,x^lastans)==find(i,y^lastans)));
		}
	}
    return 0;
}