bzoj2843 极地旅行社（lct）

lct裸题。

#include <cstdio>
#include <cstring>
#include <queue>
#include <algorithm>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 30010
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],v[N],sum[N],q[N];
bool rev[N];
inline bool isroot(int x){return x!=c[fa[x]][0]&&x!=c[fa[x]][1];}
inline void pushdown(int p){
    if(!rev[p]) return;rev[p]=0;swap(c[p][0],c[p][1]);
    rev[c[p][0]]^=1;rev[c[p][1]]^=1;
}
inline void update(int x){
    int l=c[x][0],r=c[x][1];
    sum[x]=sum[l]+sum[r]+v[x];
}
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 int find(int x){
    access(x);splay(x);while(c[x][0]) x=c[x][0];return x;
}
inline void link(int x,int y){makeroot(x);fa[x]=y;}
inline void change(int x,int val){
    splay(x);v[x]=val;update(x);
}
inline int qsum(int x,int y){
    makeroot(x);access(y);splay(y);return sum[y];
}
int main(){
//  freopen("a.in","r",stdin);
    n=read();for(int i=1;i<=n;++i) v[i]=read();m=read();
    while(m--){
        char op[20];scanf("%s",op+1);int x=read(),y=read();
        if(op[1]=='b'){
            if(find(x)==find(y)){puts("no");continue;}
            puts("yes");link(x,y);continue;
        }if(op[1]=='p'){change(x,y);continue;}
        if(find(x)!=find(y)) puts("impossible");
        else printf("%d\n",qsum(x,y));
    }return 0;
}