[主席树] BZOJ 3673 可持久化并查集 by zky BZOJ 3674 可持久化并查集加强版

#include<cstdio>
#include<cstdlib>
#include<algorithm>
#define V G[p].v
using namespace std;

inline char nc()
{
static char buf[100000],*p1=buf,*p2=buf;
if (p1==p2) { p2=(p1=buf)+fread(buf,1,100000,stdin); if (p1==p2) return EOF; }
return *p1++;
}

inline void read(int &x)
{
char c=nc(),b=1;
for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}

const int N=200005,M=10000005;

int n;

int ncnt;
int root
,ls[M],rs[M],v[M],rank[M];

void Build(int &x,int l,int r)
{
x=++ncnt; int mid=(l+r)>>1;
if (l==r) { v[x]=l; return; }
Build(ls[x],l,mid); Build(rs[x],mid+1,r);
}

void Modify(int &y,int x,int l,int r,int t,int f)
{
y=++ncnt; int mid=(l+r)>>1;
if (l==r) { v[y]=f; return; }
if(t<=mid)
rs[y]=rs[x],Modify(ls[y],ls[x],l,mid,t,f);
else
ls[y]=ls[x],Modify(rs[y],rs[x],mid+1,r,t,f);
}

int Query(int x,int l,int r,int t)
{
int mid=(l+r)>>1;
if(l==r) return x;
if(t<=mid)
return Query(ls[x],l,mid,t);
else
return Query(rs[x],mid+1,r,t);
}

void Add(int x,int l,int r,int t)
{
int mid=(l+r)>>1;
if(l==r) { rank[x]++; return; }
if(t<=mid)
Add(ls[x],l,mid,t);
else
Add(rs[x],mid+1,r,t);
}

int Fat(int k,int x)
{
int f=Query(root[k],1,n,x);
if (x==v[f]) return f;
return Fat(k,v[f]);
}

int main()
{
freopen("t.in","r",stdin);
freopen("t.out","w",stdout);
int fx,fy,Q,order,lastans=0;
int x,y;
read(n); read(Q);
Build(root[0],1,n);
for(int i=1;i<=Q;i++)
{
read(order);
if(order==1)
{
root[i]=root[i-1];
read(x); read(y); x^=lastans; y^=lastans;
fx=Fat(i,x),fy=Fat(i,y);
if (v[fx]==v[fy]) continue;
if(rank[fx]>rank[fy]) swap(fx,fy);
Modify(root[i],root[i-1],1,n,v[fx],v[fy]);
if(rank[fx]==rank[fy]) Add(root[i],1,n,v[fy]);
}
else if(order==2)
{
read(x); x^=lastans; root[i]=root[x];
}
else if (order==3)
{
root[i]=root[i-1];
read(x); read(y); x^=lastans; y^=lastans;
fx=Fat(i,x),fy=Fat(i,y);
v[fx]==v[fy]?(printf("1\n"),lastans=1):(printf("0\n"),lastans=0);
}
}
return 0;
}