[BZOJ3091][LCT]城市旅行

BZOJ3091

LCT简单题
计算期望比较简单吧，都是平衡树基操
但是BZOJ算总时间过了，单点有的我要跑1.5s

Code：

#include<bits/stdc++.h>
#define ll long long
using namespace std;
inline char nc(){
    static char buf[100000],*p1=buf,*p2=buf;
    return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}
inline int read(){
    char ch=nc();int sum=0;
    while(!(ch>='0'&&ch<='9'))ch=nc();
    while(ch>='0'&&ch<='9')sum=sum*10+ch-48,ch=nc();
    return sum;
}
inline ll lread(){
    char ch=nc();ll sum=0;
    while(!(ch>='0'&&ch<='9'))ch=nc();
    while(ch>='0'&&ch<='9')sum=sum*10+ch-48,ch=nc();
    return sum;
}
const int N=5e4+5;
namespace LCT{
	int ls[N],rs[N],fa[N],rev[N];
	int que[N];
	ll siz[N],l[N],r[N],t[N],add[N],w[N],sum[N];
	inline int isrs(register int x){return rs[fa[x]]==x;}
	inline bool isroot(register int x){
		if(!x) return true;
		return ls[fa[x]]!=x && rs[fa[x]]!=x;
	}
	inline void pushadd(register int x,ll v){
		w[x]+=v;sum[x]+=v*siz[x];
		l[x]+=v*siz[x]*(siz[x]+1)/2;
		r[x]+=v*siz[x]*(siz[x]+1)/2;
		t[x]+=v*siz[x]*(siz[x]+1)*(siz[x]+2)/6;
		add[x]+=v;
	}
	inline void pushup(register int x){
		siz[x]=siz[ls[x]]+siz[rs[x]]+1;
		sum[x]=sum[ls[x]]+sum[rs[x]]+w[x];
		l[x]=l[ls[x]]+l[rs[x]]+(w[x]+sum[rs[x]])*(siz[ls[x]]+1);
		r[x]=r[ls[x]]+r[rs[x]]+(w[x]+sum[ls[x]])*(siz[rs[x]]+1);
		t[x]=t[ls[x]]+t[rs[x]]+l[ls[x]]*(siz[rs[x]]+1)+r[rs[x]]*(siz[ls[x]]+1)+w[x]*(siz[ls[x]]+1)*(siz[rs[x]]+1);
	}
	inline void pushrev(register int x){swap(ls[x],rs[x]);swap(l[x],r[x]);rev[x]^=1;} 
	inline void pushdown(register int x){
		if(rev[x]){
			pushrev(ls[x]);
			pushrev(rs[x]);
			rev[x]=0;
		}
		if(add[x]){pushadd(ls[x],add[x]);pushadd(rs[x],add[x]);add[x]=0;}
	}
	inline void rotate(register 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);
	}
	void update(register int x){
		if(!isroot(x)) update(fa[x]);
		pushdown(x);
	}
	inline void splay(register int x){
		update(x);
		while(!isroot(x)){
			if(!isroot(fa[x])){
				if(isrs(fa[x])==isrs(x)) rotate(fa[x]);
				else rotate(x);
			}
			rotate(x);
		}
	}
	inline void access(register int x){
		for(register int y=0;x;y=x,x=fa[x]){
			splay(x);rs[x]=y;
			if(y) fa[y]=x;
			pushup(x);
		}
	}
	inline int findroot(register int x){while(fa[x]) x=fa[x];return x;}
	inline void makeroot(register int x){access(x);splay(x);pushrev(x);}
	inline void link(register int x,int y){if(findroot(x)!=findroot(y)) makeroot(x),fa[x]=y;}
	inline void split(register int x,int y){makeroot(x);access(y);splay(y);}
	inline void cut(register int x,int y){
		split(x,y);
		if(fa[x]==y) fa[x]=ls[y]=0,pushup(y);
	}
}
ll gcd(ll a,ll b){return b==0?a:gcd(b,a%b);}
using namespace LCT;
int main(){
	int n,m;
	ll z;
	n=read();m=read();
	for(register int i=1;i<=n;i++) w[i]=lread(),pushup(i);
	for(register int x,y,i=1;i<n;i++) x=read(),y=read(),link(x,y);
	int op,x,y;
	while(m--){
		op=read(),x=read(),y=read();
		if(op==1) cut(x,y);
		else if(op==2) link(x,y);
		else if(op==3){
			z=lread();
			if(findroot(x)==findroot(y)) split(x,y),pushadd(y,z);			
		}
		else{
			if(findroot(x)==findroot(y)){
				split(x,y);z=t[y];int tt=siz[y]*(siz[y]+1)/2;
				cout<<z/gcd(z,tt)<<"/"<<tt/gcd(z,tt)<<"\n";
			}
			else puts("-1");
		}
	}
	return 0;
}