bzoj4229 选择（lct+并查集维护边双）

倒着做，加边，维护边双。
lct+并查集。类似：portal
见一次不会一次系列qaq

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 100010
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,q,fa1[N],fa2[N],fa[N],c[N][2],del[N],st[N];bool rev[N];
struct edge{
    int x,y;
    edge(){}
    edge(int _x,int _y){x=_x;y=_y;}
    friend bool operator<(edge a,edge b){return a.x==b.x?a.y<b.y:a.x<b.x;}
}e[N];
struct oepr{
    int op,x,y;
}qq[N];
vector<bool>ans;
char s[5];
inline int find2(int x){return x==fa2[x]?x:fa2[x]=find2(fa2[x]);}
inline int find1(int x){return x==fa1[x]?x:fa1[x]=find1(fa1[x]);}
inline bool isroot(int x){return x!=c[find2(fa[x])][0]&&x!=c[find2(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 rotate(int x){
    int y=find2(fa[x]),z=find2(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;
}
inline void splay(int x){
    int top=0;st[++top]=x;
    for(int xx=x;!isroot(xx);xx=find2(fa[xx])) st[++top]=find2(fa[xx]);
    while(top) pushdown(st[top--]);
    while(!isroot(x)){
        int y=find2(fa[x]),z=find2(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;y=x;x=find2(fa[x]);}
}
inline void makeroot(int x){
    access(x);splay(x);rev[x]^=1;
}
inline void link(int x,int y){
    makeroot(x);fa[x]=y;
}
void dfs(int x,int id){
    fa2[x]=id;
    if(c[x][0]) dfs(c[x][0],id);
    if(c[x][1]) dfs(c[x][1],id);
}
inline void merge(int x,int y){
    x=find2(x);y=find2(y);if(x==y) return;
    int xx=find1(x),yy=find1(y);
    if(xx!=yy){link(x,y);fa1[xx]=yy;return;}
    makeroot(x);access(y);splay(y);dfs(y,y);
}
int main(){
//  freopen("a.in","r",stdin);
    n=read();m=read();q=read();
    for(int i=1;i<=n;++i) fa1[i]=fa2[i]=i;
    for(int i=1;i<=m;++i){
        e[i].x=read(),e[i].y=read();if(e[i].x>e[i].y) swap(e[i].x,e[i].y);
    }sort(e+1,e+m+1);
    for(int i=1;i<=q;++i){
        scanf("%s",s+1);if(s[1]=='P') qq[i].op=0,qq[i].x=read(),qq[i].y=read();
        else{
            qq[i].op=1,qq[i].x=read(),qq[i].y=read();if(qq[i].x>qq[i].y) swap(qq[i].x,qq[i].y);
            del[lower_bound(e+1,e+m+1,edge(qq[i].x,qq[i].y))-e]++;
        }
    }for(int i=1;i<=m;++i){
        if(del[i]){for(int j=1;j<del[i];++j) del[i+j]=1;continue;}
        merge(e[i].x,e[i].y);
    }for(int i=q;i>=1;--i){
        if(qq[i].op) merge(qq[i].x,qq[i].y);
        else ans.push_back(find2(qq[i].x)==find2(qq[i].y));
    }while(!ans.empty()) puts(ans.back()?"Yes":"No"),ans.pop_back();
    return 0;
}