bzoj 4034

继续链剖

因为子树在区间上连续，所以记最后一个位置即可

线段树不熟了。。。没注意用LL

#include<bits/stdc++.h>
#define inc(i,l,r) for(i=l;i<=r;i++)
#define dec(i,l,r) for(i=l;i>=r;i--)
#define link(x) for(edge *j=h[x];j;j=j->next)
#define mem(a) memset(a,0,sizeof(a))
#define inf 1e9
#define ll long long
#define succ(x) (1<<x)
#define NM 100000+5
using namespace std;
int read(){
    int x=0,f=1;char ch=getchar();
    while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
    while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
    return x*f;
}
struct info{
    ll z,s;
    int size;
}T[8*NM],null,_t;
struct edge{
    int t;
    edge *next;
}e[2*NM],*h[NM],*p=e;
int n,m,f[NM],size[NM],d[NM],top[NM],TOP,a[NM],id[NM],_id[NM],tot,last[NM],son[NM];
int _x,_y,l,r;
info operator+(const info&x,const info&y){
    info f;
    f.s=x.s+y.s;
    f.size=x.size+y.size;
    f.z=0;
    return f;
}
void add(int x,int y){
    p->t=y;p->next=h[x];h[x]=p;p++;
}
void pushdown(int i){
    if(T[i].z){
        T[i<<1].s+=(ll)T[i<<1].size*T[i].z;T[i<<1].z+=T[i].z;
        T[i<<1|1].s+=(ll)T[i<<1|1].size*T[i].z;T[i<<1|1].z+=T[i].z;
        T[i].z=0;
    }
}
void dfs1(int x){
    link(x)
    if(!f[j->t]){
        f[j->t]=x;
        d[j->t]=d[x]+1;
        dfs1(j->t);
        size[x]+=size[j->t];
        if(size[j->t]>size[son[x]])son[x]=j->t;
    }
    size[x]++;
}
void dfs2(int x){
    top[x]=TOP;id[x]=++tot;_id[tot]=x;
    if(son[x])dfs2(son[x]);
    link(x)
    if(!top[j->t])dfs2(TOP=j->t);
    last[x]=tot;
}
void build(int i,int x,int y){
    int t=x+y>>1;
    T[i].size=y-x+1;
    if(x==y){
        T[i].s=a[_id[x]];
        return;
    }
    build(i<<1,x,t);build(i<<1|1,t+1,y);
    T[i]=T[i<<1]+T[i<<1|1];
}
info query(int i,int x,int y){
    int t=x+y>>1;
    pushdown(i);
    if(l<=x&&y<=r)return T[i];
    if(y<l||r<x)return null;
    return query(i<<1,x,t)+query(i<<1|1,t+1,y);
}
void ch(int i,int x,int y){
    int t=x+y>>1;
    pushdown(i);
    if(l<=x&&y<=r){
        T[i].z+=(ll)_y;
        T[i].s+=(ll)T[i].size*_y;
        return;
    }
    if(y<l||r<x)return;
    ch(i<<1,x,t);ch(i<<1|1,t+1,y);
    T[i]=T[i<<1]+T[i<<1|1];
}
int main(){
//    freopen("data.in","r",stdin);
    int i;
    null.s=0;
    n=read();m=read();
    inc(i,1,n)a[i]=read();
    inc(i,1,n-1){
        _x=read();_y=read();
        add(_x,_y);add(_y,_x);
    }
    f[1]=1;
    dfs1(1);
    dfs2(TOP=1);
    build(1,1,n);
    while(m--){
        _y=read();
        if(_y==3){
            _x=read();_t.s=0;
            while(top[_x]!=1){
                l=id[top[_x]];r=id[_x];
                _t=_t+query(1,1,n);
                _x=f[top[_x]];
            }
            l=id[1];r=id[_x];
            _t=_t+query(1,1,n);
            printf("%lld
",_t.s);
        }else{
            _x=read();l=id[_x];
            if(_y==1)r=id[_x];else r=last[_x];
            _y=read();
            ch(1,1,n);
        }
    }
    return 0;
}