BZOJ 3153 Sone1

题解：水水哒AAA树啦

#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<queue>
#include<cstring>
#define PAU putchar(' ')
#define ENT putchar('\n')
#define CH for(int d=0;d<=1;d++) if(ch[d])
using namespace std;
const int maxn=100000+10,inf=-1u>>1;
struct info{int mi,mx,siz,sm;}null=(info){inf,-inf,0,0};
struct tag{int mul,add;bool empty(){return (mul==1&&add==0);}}nulltag=(tag){1,0};
info operator+(const info&a,const info&b){
    return (info){min(a.mi,b.mi),max(a.mx,b.mx),a.siz+b.siz,a.sm+b.sm};
}
info operator+(const info&a,const tag&b){
    return a.siz?(info){a.mi*b.mul+b.add,a.mx*b.mul+b.add,a.siz,a.sm*b.mul+b.add*a.siz}:null;
}
tag operator+(const tag&a,const tag&b){
    return (tag){a.mul*b.mul,a.add*b.mul+b.add};
}
struct snode{
    snode*ch[2],*fa;
    info x,sm;tag od,all;
    void init(){x=sm=null;od=all=nulltag;ch[0]=ch[1]=fa=NULL;return;}
    snode(){x=sm=null;od=all=nulltag;ch[0]=ch[1]=fa=NULL;}
    void addt(tag a){
        od=od+a;all=all+a;x=x+a;sm=sm+a;return;
    }
    void down(){
        if(!od.empty()){CH{ch[d]->addt(od);};od=nulltag;}return;
    }
    void update(){
        sm=x;CH{sm=sm+ch[d]->sm;}return;
    }
}Splay[maxn],*root[maxn];
int parent(snode*x,snode*&y){return (y=x->fa)?y->ch[1]==x?1:y->ch[0]==x?0:-1:-1;}
void rotate(snode*x){
    snode*y,*z;int d1=parent(x,y),d2=parent(y,z);
    if(y->ch[d1]=x->ch[d1^1]) y->ch[d1]->fa=y;
    y->fa=x;x->fa=z;x->ch[d1^1]=y;
    if(d2!=-1) z->ch[d2]=x;
    y->update();return;
}
void pushdown(snode*x){
    static snode*s[maxn];int top=0;
    for(snode*y;;x=y){
        s[top++]=x;y=x->fa;
        if(!y||(y->ch[0]!=x&&y->ch[1]!=x)) break;
    } while(top--) s[top]->down();return;
}
snode*splay(snode*x){
    pushdown(x);snode*y,*z;int d1,d2;
    while(true){
        if((d1=parent(x,y))<0) break;
        if((d2=parent(y,z))<0){rotate(x);break;}
        if(d1==d2) rotate(y),rotate(x);
        else rotate(x),rotate(x);
    } x->update();return x;
}
snode*join(snode*x,snode*y){
    if(!x)return y;if(!y)return x;
    while(x->ch[1]) x->down(),x=x->ch[1];
    splay(x)->ch[1]=y;y->fa=x;x->update();return x;
}
struct node{
    node*ch[2],*fa,*s[2];
    info x,sm,sb,all;tag cha,tre;bool rev;
    int id;
    void revt(){
        swap(ch[0],ch[1]);swap(s[0],s[1]);rev^=1;return;
    }
    void chat(tag a){
        x=x+a;sm=sm+a;cha=cha+a;all=sm+sb;return;
    }
    void tret(tag a){
        tre=tre+a;sb=sb+a;all=sm+sb;if(root[id])root[id]->addt(a);return;
    }
    void down(){
        if(rev){CH{ch[d]->revt();}rev=false;}
        if(!cha.empty()){CH{ch[d]->chat(cha);}cha=nulltag;}
        if(!tre.empty()){CH{ch[d]->tret(tre);}tre=nulltag;}
        return;
    }
    void update(){
        sm=x;sb=null;
        if(root[id])sb=sb+root[id]->sm;
        CH{sm=sm+ch[d]->sm;sb=sb+ch[d]->sb;}
        all=sm+sb;
        s[0]=ch[0]?ch[0]->s[0]:this;
        s[1]=ch[1]?ch[1]->s[1]:this;
        return;
    }
}lct[maxn];
int parent(node*x,node*&y){return (y=x->fa)?y->ch[1]==x?1:y->ch[0]==x?0:-1:-1;}
void rotate(node*x){
    node*y,*z;int d1=parent(x,y),d2=parent(y,z);
    if(y->ch[d1]=x->ch[d1^1]) y->ch[d1]->fa=y;
    y->fa=x;x->fa=z;x->ch[d1^1]=y;
    if(d2!=-1) z->ch[d2]=x;
    y->update();return;
}
void pushdown(node*x){
    static node*s[maxn];int top=0;
    for(node*y;;x=y){
        s[top++]=x;y=x->fa;
        if(!y||(y->ch[0]!=x&&y->ch[1]!=x)) break;
    } while(top--) s[top]->down();return;
}
node*splay(node*x){
    pushdown(x);node*y,*z;int d1,d2;
    while(true){
        if((d1=parent(x,y))<0) break;
        if((d2=parent(y,z))<0){rotate(x);break;}
        if(d1==d2) rotate(y),rotate(x);
        else rotate(x),rotate(x);
    } x->update();return x;
}
void detach(node*x){
    snode*p=x->ch[1]->s[0]->id+Splay;p->init();
    p->x=x->ch[1]->all;x->ch[1]=NULL;
    int id=x->id;
    p->ch[0]=root[id];
    if(root[id]) root[id]->fa=p;
    p->update();root[id]=p;return;
}
void connect(node*x,node*y){
    snode*p=y->s[0]->id+Splay;
    int id=x->id;splay(p);
    if(p->ch[0]) p->ch[0]->fa=NULL;
    if(p->ch[1]) p->ch[1]->fa=NULL;
    root[id]=join(p->ch[0],p->ch[1]);
    y->chat(p->all);y->tret(p->all);return;
}
node*access(node*x){
    node*ret=NULL;
    for(;x;x=x->fa){
        splay(x);if(x->ch[1]) detach(x);
        x->ch[1]=ret;if(ret) connect(x,ret);
        (ret=x)->update();
    } return ret;
}
void makeroot(int x){access(x+lct)->revt();return;}
void link(int x,int y){
    makeroot(x);splay(lct+x)->fa=lct+y;
    access(lct+y);splay(lct+y)->ch[1]=lct+x;
    return;
}
void changesub(int x,int y,tag t){
    makeroot(x);access(lct+y);splay(lct+y);
    lct[y].x=lct[y].x+t;
    if(root[y]) root[y]->addt(t);
    lct[y].update();return;
}
void changecha(int x,int y,tag t){
    makeroot(x);access(lct+y)->chat(t);return;
}
info querycha(int x,int y){
    makeroot(x);return access(lct+y)->sm;
}
info querysub(int x,int y){
    makeroot(x);access(lct+y);splay(lct+y);return root[y]?lct[y].x+root[y]->sm:lct[y].x;
}
int treeroot;
void cutfa(int x){
    node*t=(access(lct+x),splay(lct+x));
    t->ch[0]=t->ch[0]->fa=NULL;t->update();return;
}
void linkfa(int x,int fa){
    access(fa+lct);splay(lct+fa);
    makeroot(x);splay(lct+x)->fa=lct+fa;lct[fa].update();
    snode*p=Splay+x;p->init();p->x=lct[x].all;
    p->ch[0]=root[fa];if(root[fa]) root[fa]->fa=p;
    root[fa]=p;p->update();return;
}
void splitfa(int r,int x,int fa){
    makeroot(r);if((access(lct+x),access(lct+fa))==lct+x) return;
    cutfa(x);linkfa(x,fa);return;
}
int n,Q,p1[maxn],p2[maxn],A[maxn];
void inittree(int*a){
    for(int i=1;i<=n;i++){
        lct[i].id=i;
        lct[i].s[0]=lct[i].s[1]=lct+i;
        lct[i].x=lct[i].sm=lct[i].all=(info){a[i],a[i],1,a[i]};
        lct[i].cha=lct[i].tre=nulltag;
    } return;
}
inline int read(){
    int x=0,sig=1;char ch=getchar();
    while(!isdigit(ch)){if(ch=='-')sig=-1;ch=getchar();}
    while(isdigit(ch))x=10*x+ch-'0',ch=getchar();
    return x*=sig;
}
inline void write(int x){
    if(x==0){putchar('0');return;}if(x<0)putchar('-'),x=-x;
    int len=0,buf[15];while(x)buf[len++]=x%10,x/=10;
    for(int i=len-1;i>=0;i--)putchar(buf[i]+'0');return;
}
void init(){
    n=read();Q=read();
    for(int i=2;i<=n;i++) p1[i]=read(),p2[i]=read();
    for(int i=1;i<=n;i++) A[i]=read();
    inittree(A);
    for(int i=2;i<=n;i++) link(p1[i],p2[i]);
    treeroot=read();makeroot(treeroot);
    return;
}
void work(){
    int x,y,z,tp;
    while(Q--){
        tp=read();x=read();
        if(tp==0) y=read(),changesub(treeroot,x,(tag){0,y});
        else if(tp==1) makeroot(x),treeroot=x;
        else if(tp==2) y=read(),z=read(),changecha(x,y,(tag){0,z});
        else if(tp==3) write(querysub(treeroot,x).mi),ENT;
        else if(tp==4) write(querysub(treeroot,x).mx),ENT;
        else if(tp==5) y=read(),changesub(treeroot,x,(tag){1,y});
        else if(tp==6) y=read(),z=read(),changecha(x,y,(tag){1,z});
        else if(tp==7) y=read(),write(querycha(x,y).mi),ENT;
        else if(tp==8) y=read(),write(querycha(x,y).mx),ENT;
        else if(tp==9) y=read(),splitfa(treeroot,x,y);
        else if(tp==10) y=read(),write(querycha(x,y).sm),ENT;
        else if(tp==11) write(querysub(treeroot,x).sm),ENT;
    }
    return;
}
void print(){
    return;
}
int main(){init();work();print();return 0;}