[BZOJ 2843] 极地旅行社

题目描述：

裸的不能再裸的LCT啦

题目分析：

维护子树和即可.

题目链接：

BZOJ 2843

Ac 代码：

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
const int maxm=4e5+100; 
int val[maxm];
int n,m;
namespace LCT{
    int top,son[maxm][2],fa[maxm],sum[maxm],stk[maxm],rev[maxm];
    inline void pushup(int x)
    {
        sum[x]=val[x];
        sum[x]+=sum[son[x][0]]+sum[son[x][1]];
    }
    inline void pushdown(int x)
    {
        if(rev[x])
        {
            rev[son[x][0]]^=1,rev[son[x][1]]^=1,rev[x]=0;
            std::swap(son[x][0],son[x][1]);
        }
    }
    inline bool isroot(int x)
    {
        return ((son[fa[x]][1]!=x)&&(son[fa[x]][0]!=x));
    }
    inline void rotate(int x)
    {
        int fa1=fa[x],fa2=fa[fa1],l;
        l=son[fa1][0]==x?0:1;
        int r=l^1;
        if(!isroot(fa1))
        {
            if(son[fa2][0]==fa1) son[fa2][0]=x;
            else son[fa2][1]=x;
        }
        fa[x]=fa2;
        fa[fa1]=x;
        fa[son[x][r]]=fa1;
        son[fa1][l]=son[x][r];
        son[x][r]=fa1;
        pushup(fa1),pushup(x);
    }
    inline void splay(int x)
    {
        top=1;
        stk[top]=x;
        for(int i=x;!isroot(i);i=fa[i]) stk[++top]=fa[i];
        for(int i=top;i;i--) pushdown(stk[i]);
        while(!isroot(x))
        {
            int y=fa[x],z=fa[y];
            if(!isroot(y))
            {
                if((son[y][0]==x)^(son[z][0]==y)) rotate(x);
                else rotate(y);
            }
            rotate(x);
        }
    }
    inline void access(int x){for(int t=0;x;t=x,x=fa[x]) splay(x),son[x][1]=t,pushup(x);}
    inline void makeroot(int x){access(x),splay(x),rev[x]^=1;}
    inline int findroot(int x){access(x),splay(x);while(son[x][0]) x=son[x][0];return x;}
    inline void split(int x,int y){makeroot(x);access(y);splay(y);}
    inline void cut(int x,int y){split(x,y);if(son[y][0]==x) son[y][0]=0,fa[x]=0;}
    inline void link(int x,int y){makeroot(x);fa[x]=y;}
}
using namespace LCT;
int main()
{
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
     scanf("%d",&val[i]),sum[i]=val[i];
    scanf("%d",&m);
    for(int i=1;i<=m;i++)
    {
        char s[20];
        scanf("%s",s);
        if(s[0]=='b')
        {
            int x,y;
            scanf("%d%d",&x,&y);
            if(findroot(x)==findroot(y)) printf("no\n");
            else printf("yes\n"),link(x,y);
        } 
        if(s[0]=='p')
        {
            int x,y;
            scanf("%d%d",&x,&y);
            splay(x);
            val[x]=y;
            pushup(x);
        }
        if(s[0]=='e')
        {
            int x,y;
            scanf("%d%d",&x,&y);
            if(findroot(x)!=findroot(y)) printf("impossible\n");
            else split(x,y),printf("%d\n",sum[y]);
        }
    }
    return 0;
}