BZOJ3282Tree(动态树lct)

题意：传送门

题解：参考传送门

附上代码(对于上文中的作了部分修改)：

 
#include<bits/stdc++.h>
#define il inline
#define lc c[x][0]
#define rc c[x][1]
using namespace std;
const int maxn=3e5+5;
il int read()
{
    char ch=getchar();
    int f=1,x=0;
    while(!(ch>='0'&&ch<='9')){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-48;ch=getchar();}
    return x*f;
}
int f[maxn],c[maxn][2],v[maxn],s[maxn],st[maxn];
bool r[maxn];
il bool nroot(int x)
{
    return c[f[x]][0]==x||c[f[x]][1]==x;
}
il void pushup(int x)
{
    s[x]=s[lc]^s[rc]^v[x];
}
il void pushdown(int x)
{
    if(r[x])
    {
        r[lc]^=1;r[rc]^=1;r[x]=0;
        swap(lc,rc);
    }
}
il void rotate(int x){
    int y=f[x],z=f[y],k=c[y][1]==x,w=c[x][!k];
    if(nroot(y))c[z][c[z][1]==y]=x;c[x][!k]=y;c[y][k]=w;
    if(w)f[w]=y;f[y]=x;f[x]=z;
    pushup(y);pushup(x);
}
il void splay(int x){
    int y=x,z=0;
    st[++z]=y;
    while(nroot(y))st[++z]=y=f[y];
    while(z)pushdown(st[z--]);
    while(nroot(x))
    {
        y=f[x];z=f[y];
        if(nroot(y))rotate((c[y][0]==x)^(c[z][0]==y)?x:y);
        rotate(x);
    }
}
il void access(int x)
{
    for(int y=0;x;x=f[y=x])
        splay(x),rc=y,pushup(x);
}
il void makeroot(int x)
{
    access(x);splay(x);r[x]^=1;
}
il int findroot(int x)
{
    access(x);splay(x);
    while(lc)pushdown(x),x=lc;
    splay(x);
    return x;
}
il void split(int x,int y)
{
    makeroot(x);access(y);splay(y);
}
il void link(int x,int y)
{
    makeroot(x);
    if(findroot(y)!=x)f[x]=y;
}
il void cut(int x,int y)
{
    makeroot(x);
    if(findroot(y)==x&&f[y]==x&&!c[y][0])
    {
        f[y]=c[x][1]=0;
        pushup(x);
    }
}
int main()
{
    int n=read(),m=read();
    for(int i=1;i<=n;i++)v[i]=read();
    while(m--)
    {
        int type=read(),x=read(),y=read();
        switch(type)
        {
            case 0:split(x,y);printf("%d\n",s[y]);break;
            case 1:link(x,y);break;
            case 2:cut(x,y);break;
            case 3:splay(x);v[x]=y;
        }
    }
    return 0;
}