[BZOJ3639][LCT]Qtree7

BZOJ3639

和上题没啥区别吧
就是多了个统计子树最大值，可以用splay或者multiset搞

Code：

#include<bits/stdc++.h>
using namespace std;
inline int read(){
	int res=0,f=1;char ch=getchar();
	while(!isdigit(ch)) {if(ch=='-') f=-f;ch=getchar();}
	while(isdigit(ch)) {res=(res<<1)+(res<<3)+(ch^48);ch=getchar();}
	return res*f;
}
const int N=1e5+5;
const int INF=1<<30;
int f[N],v[N],vis[N<<1],col[N],head[N<<1],nxt[N<<1],tot=0;
inline void add(int x,int y){vis[++tot]=y;nxt[tot]=head[x];head[x]=tot;}
struct LCT{
	multiset<int>s[N];
	int ls[N],rs[N],mx[N],fa[N];
	LCT(){mx[0]=-INF;}
	inline int isrs(int x){return rs[fa[x]]==x;}
	inline bool isroot(int x){
		if(!x) return true;
		return ls[fa[x]]!=x && rs[fa[x]]!=x;
	}
	inline void pushup(int x){
		mx[x]=max(v[x],max(mx[ls[x]],mx[rs[x]]));
		if(!s[x].empty()) mx[x]=max(mx[x],*s[x].rbegin());
	}
	inline void rotate(int x){
		int y=fa[x],z=fa[y],b=(ls[y]==x?rs[x]:ls[x]);
		if(z && !isroot(y)) (ls[z]==y?ls[z]:rs[z])=x;
		fa[x]=z,fa[y]=x,b?fa[b]=y:0;
		if(ls[y]==x) rs[x]=y,ls[y]=b;
		else ls[x]=y,rs[y]=b;
		pushup(y);pushup(x);
	}
	inline void splay(int x){
		while(!isroot(x)){
			while(!isroot(fa[x])){
				if(isrs(x)==isrs(fa[x])) rotate(fa[x]);
				else rotate(x);
			}
			rotate(x);
		}
		pushup(x);
	}
	inline void access(int x){
		for(int y=0;x;y=x,x=fa[x]){
			splay(x);
			if(rs[x]) s[x].insert(mx[rs[x]]);
			if(rs[x]=y) s[x].erase(s[x].find(mx[y]));
			pushup(x);
		}
	}
	inline int findroot(int x){
		access(x);splay(x);
		while(ls[x]) x=ls[x];
		splay(x);return x;
	}
	inline void link(int x){
		splay(x);int y=fa[x]=f[x];
		access(y);splay(y);rs[y]=x;pushup(y);
	}
	inline void cut(int x){
		access(x);splay(x);
		ls[x]=fa[ls[x]]=0;
		pushup(x);
	}
	inline void update(int x){access(x);splay(x);v[x]=read();pushup(x);}
}lct[2];
void dfs(int x,int y){
    f[x]=y;
    for(int i=head[x];i;i=nxt[i])
        if(vis[i]!=y) dfs(vis[i],x);
    lct[col[x]].link(x);
}
int main(){
	int n,m;
	n=read();
	for(int x,y,i=1;i<n;++i){x=read();y=read();add(x,y);add(y,x);}
	for(int i=1;i<=n;i++) col[i]=read();
	for(int i=1;i<=n;i++) v[i]=read();
	dfs(1,f[1]=n+1);
	m=read();
	while(m--){
		int op=read(),x=read();
		if(!op) cout<<lct[col[x]].mx[lct[col[x]].rs[lct[col[x]].findroot(x)]]<<"\n";
		else if(op==1){lct[col[x]].cut(x);col[x]^=1;lct[col[x]].link(x);}
		else lct[col[x]].update(x);
	}
	return 0;
}