[BZOJ2361][LCT]tree

版权声明：虽然博主很菜，但是还是请注明出处（我觉得应该没人偷我的博客） https://blog.csdn.net/qq_43346903/article/details/88202199

BZOJ2631

练习一下打标记LCT

要用UNSIGNED INT！！！！！！！！！！！

LONGLONG 要T

Code：

#include<bits/stdc++.h>
#define int unsigned int
#define mod 51061
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;
namespace LCT{
	int que[N];
	int v[N],sum[N],siz[N];
	int fa[N],c[N][2],rev[N],add[N],mul[N];
	inline bool isroot(int x){return c[fa[x]][0]!=x&&c[fa[x]][1]!=x;}
	inline void pushup(int x){
		siz[x]=(siz[c[x][0]]+siz[c[x][1]]+1)%mod;
		sum[x]=(sum[c[x][0]]+sum[c[x][1]]+v[x])%mod;
	}
	inline void update(int x,int ad,int mu){
		if(!x) return;
		v[x]=(v[x]*mu%mod+ad)%mod;
		sum[x]=(sum[x]*mu%mod+siz[x]*ad%mod)%mod;
		add[x]=(add[x]*mu%mod+ad)%mod;
		mul[x]=mul[x]*mu%mod;
	}
	inline void pushdown(int x){
		if(rev[x]){rev[c[x][0]]^=1;rev[c[x][1]]^=1;rev[x]^=1;swap(c[x][0],c[x][1]);}
		if(add[x]!=0 || mul[x]!=1) {update(c[x][0],add[x],mul[x]);update(c[x][1],add[x],mul[x]);}
		add[x]=0;mul[x]=1;
	}
	void rotate(int x){
		int y=fa[x],z=fa[y],l,r;
		if (x==c[y][0]) l=0;else l=1;r=l^1;
		if (!isroot(y)){if (c[z][0]==y)c[z][0]=x;else c[z][1]=x;}
		fa[x]=z;fa[y]=x;fa[c[x][r]]=y;
		c[y][l]=c[x][r];c[x][r]=y;
		pushup(y);pushup(x);
	}
	void splay(int x){
		que[que[0]=1]=x;
		for(int i=x;!isroot(i);i=fa[i]) que[++que[0]]=fa[i]; 
		for (int i=que[0];i;i--) pushdown(que[i]);
		while(!isroot(x)){
			int y=fa[x],z=fa[y];
			if(!isroot(y)){
				if(c[y][0]==x^c[z][0]==y) rotate(x);
				else rotate(y);
			}
			rotate(x);
		}
	}
	inline void access(int x){int t(0);while (x){splay(x);c[x][1]=t;t=x;pushup(x);x=fa[x];}}
	inline int findroot(int x){
		access(x);splay(x);
		while(pushdown(x),c[x][0]) x=c[x][0];
		splay(x);return x;
	}
	inline void makeroot(int x){access(x);splay(x);rev[x]^=1;}
	inline void link(int x,int y){makeroot(x);fa[x]=y;}
	inline void cut(int x,int y){makeroot(x);access(y);splay(y);c[y][0]=fa[x]=0;}
	inline void split(int x,int y){makeroot(y);access(x);splay(x);}
}
using namespace LCT;
int n,q;
int x,y,w;
char ch[10];
signed main(){
	n=read();q=read();
 	for(int i=1;i<=n;i++) mul[i]=siz[i]=v[i]=sum[i]=1;
 	for(int i=1;i<n;i++) link(read(),read());
 	for(int i=1;i<=q;i++){
	  	scanf("%s",ch);x=read();y=read();
	  	if(ch[0]=='+') {w=read();split(x,y);update(x,w,1);}
	  	if(ch[0]=='-') {cut(x,y);link(read(),read());}
	  	if(ch[0]=='*') {w=read();split(x,y);update(x,0,w);}
	  	if(ch[0]=='/') {split(x,y);cout<<sum[x]<<"\n";}
 	}
}