【bzoj3282】Tree LCT

AC通道：http://www.lydsy.com/JudgeOnline/problem.php?id=3282

【題解】

模板題，xor什麼的跟求和是一樣的。

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<cmath>
#include<algorithm>
using namespace std;
#define FILE "read"
#define MAXN 300010
#define up(i,j,n) for(int i=j;i<=n;++i)
#define dn(i,j,n) for(int i=j;i>=n;--i)
#define cmax(a,b) a=max(a,b)
#define cmin(a,b) a=min(a,b)
namespace INIT{
	char buf[1<<15],*fs,*ft;
	inline char getc(){return (fs==ft&&(ft=(fs=buf)+fread(buf,1,1<<15,stdin),fs==ft))?0:*fs++;}
	inline int read(){
		int x=0,f=1;  char ch=getc();
		while(!isdigit(ch))  {if(ch=='-')  f=-1;  ch=getc();}
		while(isdigit(ch))  {x=x*10+ch-'0';  ch=getc();}
		return x*f;
	}
}using namespace INIT;
namespace Link_Cut_Tree{
	int v[MAXN],sum[MAXN],vis[MAXN],f[MAXN],stack[MAXN],son[MAXN][2];
	bool get(int x){return son[f[x]][1]==x;}
	bool isroot(int x){return son[f[x]][0]!=x&&son[f[x]][1]!=x;}
	void updata(int x){sum[x]=sum[son[x][0]]^sum[son[x][1]]^v[x];}
	void pushdown(int x){
		if(vis[x]){
			swap(son[x][0],son[x][1]);
			vis[son[x][0]]^=1; vis[son[x][1]]^=1;
			vis[x]=0;
		}
	}
	void rotate(int x){
		int y=f[x],z=f[y],which=get(x);
		if(!isroot(y))  son[z][son[z][1]==y]=x;
		son[y][which]=son[x][which^1]; f[son[y][which]]=y;
		son[x][which^1]=y;  f[y]=x; f[x]=z;
		updata(y);  updata(x);
	}
	void splay(int x){
		int top(0); stack[++top]=x;
		for(int i=x;!isroot(i);i=f[i])  stack[++top]=f[i];
		dn(i,top,1)  pushdown(stack[i]);
		for(int y=f[x];!isroot(x);rotate(x),y=f[x])
			if(!isroot(y))  rotate(get(x)==get(y)?y:x);
	}
	void access(int x){for(int t(0);x;t=x,x=f[x])splay(x),son[x][1]=t,updata(x);}
	void reverse(int x){access(x);splay(x);vis[x]^=1;}
	void split(int x,int y){reverse(x);access(y);splay(y);}
	void linkk(int x,int y){reverse(x);f[x]=y;}
	void cut(int x,int y){split(x,y);son[y][0]=f[x]=0;}
	int find(int x){access(x);splay(x);while(son[x][0])x=son[x][0];return x;}
}
int main(){
	freopen(FILE".in","r",stdin);
	freopen(FILE".out","w",stdout);
	using namespace Link_Cut_Tree;
	int n=read(),m=read();
	up(i,1,n)  v[i]=sum[i]=read();
	up(i,1,m){
		int flag=read(),x=read(),y=read();
		if(flag==0){split(x,y);printf("%d\n",sum[y]);}
		else if(flag==1){if(find(x)!=find(y))linkk(x,y);}
		else if(flag==2)cut(x,y);
		else{splay(x);v[x]=sum[x]=y;updata(x);}
	}
	return 0;
}