bzoj2631 tree（lct）

先下放乘法标记，再下放加法标记。
注意这题很坑的模数，51061*51061会爆int！！！

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 100010
#define mod 51061
inline int read(){
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
    return x*f;
}
int n,m,fa[N],c[N][2],sz[N],sum[N],add[N],mul[N],h[N],num=0;
bool rev[N];int q[N],v[N];
struct edge{
    int to,next,val;
}data[N<<1];
inline void dfs(int x){
    for(int i=h[x];i;i=data[i].next){
        int y=data[i].to;if(y==fa[x]) continue;
        fa[y]=x;dfs(y);
    }
}
inline bool isroot(int x){
    return x!=c[fa[x]][0]&&x!=c[fa[x]][1];
}
inline void update(int p){
    int l=c[p][0],r=c[p][1];
    sz[p]=sz[l]+sz[r]+1;
    sum[p]=sum[l]+sum[r]+v[p];sum[p]%=mod;
}
inline void add1(int p,int val){
    if(!p) return;
    add[p]+=val;add[p]%=mod;v[p]+=val;v[p]%=mod;
    sum[p]=(sum[p]+(ll)sz[p]*val)%mod;
}
inline void mul1(int p,int val){
    if(!p) return;
    mul[p]=(ll)mul[p]*val%mod;v[p]=(ll)v[p]*val%mod;
    add[p]=(ll)add[p]*val%mod;sum[p]=(ll)sum[p]*val%mod;
}
inline void pushdown(int p){
    int l=c[p][0],r=c[p][1];
    if(rev[p]){
        rev[p]=0;rev[l]^=1;rev[r]^=1;swap(c[p][0],c[p][1]);
    }if(mul[p]!=1){
        mul1(l,mul[p]);mul1(r,mul[p]);mul[p]=1;
    }if(add[p]){
        add1(l,add[p]);add1(r,add[p]);add[p]=0;
    }
}
inline void rotate(int x){
    int y=fa[x],z=fa[y],l=x==c[y][1],r=l^1;
    if(!isroot(y)) c[z][y==c[z][1]]=x;
    fa[c[x][r]]=y;fa[y]=x;fa[x]=z;
    c[y][l]=c[x][r];c[x][r]=y;update(y);update(x);
}
inline void splay(int x){
    int top=0;q[++top]=x;
    for(int xx=x;!isroot(xx);xx=fa[xx]) q[++top]=fa[xx];
    while(top) pushdown(q[top--]);
    while(!isroot(x)){
        int y=fa[x],z=fa[y];
        if(!isroot(y)){
            if(x==c[y][1]^y==c[z][1]) rotate(x);
            else rotate(y);
        }rotate(x);
    }
}
inline void access(int x){
    int y=0;
    while(x){splay(x);c[x][1]=y;update(x);y=x;x=fa[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;update(y);
}
inline void doadd(int x,int y,int val){
    makeroot(x);access(y);splay(y);add1(y,val);
}
inline void domul(int x,int y,int val){
    makeroot(x);access(y);splay(y);mul1(y,val);
}
inline void query(int x,int y){
    makeroot(x);access(y);splay(y);
    printf("%d\n",sum[y]);
}
int main(){
//  freopen("a.in","r",stdin);
    n=read();m=read();
    for(int i=1;i<=n;++i) v[i]=1,mul[i]=1;
    for(int i=1;i<n;++i){
        int x=read(),y=read();
        data[++num].to=y;data[num].next=h[x];h[x]=num;
        data[++num].to=x;data[num].next=h[y];h[y]=num;
    }dfs(1);
    while(m--){
        char op[5];scanf("%s",op+1);int x=read(),y=read();
        if(op[1]=='+'){doadd(x,y,read());continue;}
        if(op[1]=='*'){domul(x,y,read());continue;}
        if(op[1]=='/'){query(x,y);continue;}
        cut(x,y);x=read();y=read();link(x,y);
    }return 0;
}