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=+,inf=-1u>>;
 struct info{int mi,mx,siz,sm;}null=(info){inf,-inf,,};
 struct tag{int mul,add;bool empty(){return (mul==&&add==);}}nulltag=(tag){,};
 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[],*fa;
     info x,sm;tag od,all;
     void init(){x=sm=null;od=all=nulltag;ch[]=ch[]=fa=NULL;return;}
     snode(){x=sm=null;od=all=nulltag;ch[]=ch[]=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[]==x?:y->ch[]==x?:-:-;}
 void rotate(snode*x){
     snode*y,*z;int d1=parent(x,y),d2=parent(y,z);
     if(y->ch[d1]=x->ch[d1^]) y->ch[d1]->fa=y;
     y->fa=x;x->fa=z;x->ch[d1^]=y;
     if(d2!=-) z->ch[d2]=x;
     y->update();return;
 }
 void pushdown(snode*x){
     static snode*s[maxn];int top=;
     for(snode*y;;x=y){
         s[top++]=x;y=x->fa;
         if(!y||(y->ch[]!=x&&y->ch[]!=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))<) break;
         if((d2=parent(y,z))<){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[]) x->down(),x=x->ch[];
     splay(x)->ch[]=y;y->fa=x;x->update();return x;
 }
 struct node{
     node*ch[],*fa,*s[];
     info x,sm,sb,all;tag cha,tre;bool rev;
     int id;
     void revt(){
         swap(ch[],ch[]);swap(s[],s[]);rev^=;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[]=ch[]?ch[]->s[]:this;
         s[]=ch[]?ch[]->s[]:this;
         return;
     }
 }lct[maxn];
 int parent(node*x,node*&y){return (y=x->fa)?y->ch[]==x?:y->ch[]==x?:-:-;}
 void rotate(node*x){
     node*y,*z;int d1=parent(x,y),d2=parent(y,z);
     if(y->ch[d1]=x->ch[d1^]) y->ch[d1]->fa=y;
     y->fa=x;x->fa=z;x->ch[d1^]=y;
     if(d2!=-) z->ch[d2]=x;
     y->update();return;
 }
 void pushdown(node*x){
     static node*s[maxn];int top=;
     for(node*y;;x=y){
         s[top++]=x;y=x->fa;
         if(!y||(y->ch[]!=x&&y->ch[]!=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))<) break;
         if((d2=parent(y,z))<){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[]->s[]->id+Splay;p->init();
     p->x=x->ch[]->all;x->ch[]=NULL;
     int id=x->id;
     p->ch[]=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[]->id+Splay;
     int id=x->id;splay(p);
     if(p->ch[]) p->ch[]->fa=NULL;
     if(p->ch[]) p->ch[]->fa=NULL;
     root[id]=join(p->ch[],p->ch[]);
     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[]) detach(x);
         x->ch[]=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[]=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[]=t->ch[]->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[]=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=;i<=n;i++){
         lct[i].id=i;
         lct[i].s[]=lct[i].s[]=lct+i;
         lct[i].x=lct[i].sm=lct[i].all=(info){a[i],a[i],,a[i]};
         lct[i].cha=lct[i].tre=nulltag;
     } return;
 }
 inline int read(){
     int x=,sig=;char ch=getchar();
     while(!isdigit(ch)){if(ch=='-')sig=-;ch=getchar();}
     while(isdigit(ch))x=*x+ch-'',ch=getchar();
     return x*=sig;
 }
 inline void write(int x){
     if(x==){putchar('');return;}if(x<)putchar('-'),x=-x;
     int len=,buf[];while(x)buf[len++]=x%,x/=;
     for(int i=len-;i>=;i--)putchar(buf[i]+'');return;
 }
 void init(){
     n=read();Q=read();
     for(int i=;i<=n;i++) p1[i]=read(),p2[i]=read();
     for(int i=;i<=n;i++) A[i]=read();
     inittree(A);
     for(int i=;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==) y=read(),changesub(treeroot,x,(tag){,y});
         else if(tp==) makeroot(x),treeroot=x;
         else if(tp==) y=read(),z=read(),changecha(x,y,(tag){,z});
         else if(tp==) write(querysub(treeroot,x).mi),ENT;
         else if(tp==) write(querysub(treeroot,x).mx),ENT;
         else if(tp==) y=read(),changesub(treeroot,x,(tag){,y});
         else if(tp==) y=read(),z=read(),changecha(x,y,(tag){,z});
         else if(tp==) y=read(),write(querycha(x,y).mi),ENT;
         else if(tp==) y=read(),write(querycha(x,y).mx),ENT;
         else if(tp==) y=read(),splitfa(treeroot,x,y);
         else if(tp==) y=read(),write(querycha(x,y).sm),ENT;
         else if(tp==) write(querysub(treeroot,x).sm),ENT;
     }
     return;
 }
 void print(){
     return;
 }
 int main(){init();work();print();return ;}