【bzoj2733】永无乡(无旋treap启发式合并 + 并查集)

传送门

题目分析

　　起初每个岛都是一个平衡树， 并查集的祖先都是自己。合并两岛时，pri较小的祖先会被作为合并后的祖先， 而两颗平衡树采用启发式合并。查询k值就是基本操作。

code

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<cmath>
#include<algorithm>
#include<vector>
using namespace std;

const int N = 1e5 + ;
int n, m;
#define SZ(x) (x?x->sze:0)
struct node{
    node *lc, *rc;
    int pri, sze, val, num;
    inline node* upt(){
        sze = SZ(lc) + SZ(rc) + ;
        return this;
    }
}pool[N], *tail = pool, *nod[N];
int fa[N];

inline int Rand(){
    static int RAND_VAL = ;
    return RAND_VAL += RAND_VAL <<  | ;
}

inline node* newNode(int v, int k){
    node *x = ++tail;
    x->sze = , x->val = v, x->pri = Rand(), x->num = k;
    return x;
}

inline node* Merge2(node *u, node *v){
    if(!u) return v;
    if(!v) return u;
    if(u->pri < v->pri){
        u->rc = Merge2(u->rc, v);
        return u->upt();
    }
    else{
        v->lc = Merge2(u, v->lc);
        return v->upt();
    }
}

inline int getAnc(int a){
    return fa[a] == a ? a : (fa[a] = getAnc(fa[a]));
}

inline void Split_v(node *u, int v, node *&x, node *&y){
    if(!u){
        x = y = NULL;
        return;
    }
    if(u->val <= v){
        Split_v(u->rc, v, x, y);
        u->rc = NULL, u->upt();
        x = Merge2(u, x);
    }
    else{
        Split_v(u->lc, v, x, y);
        u->lc = NULL, u->upt();
        y = Merge2(y, u);
    }
}

inline void Split_k(node *u, int k, node *&x, node *&y){
    if(!u){
        x = y = NULL;
        return;
    }
    if(SZ(u->lc) < k){
        Split_k(u->rc, k - SZ(u->lc) - , x, y);
        u->rc = NULL, u->upt();
        x = Merge2(u, x);
    }
    else{
        Split_k(u->lc, k, x, y);
        u->lc = NULL, u->upt();
        y = Merge2(y, u);
    }
}

inline node* Merge(node *u, node *v){
    if(!u) return v;
    if(!v) return u;
    node *L, *R;
    if(u->pri > v->pri) swap(u, v);
    Split_v(v, u->val, L, R);
    u->lc = Merge(u->lc, L);
    u->rc = Merge(u->rc, R);
    return u->upt();
}

inline int read(){
    int i = , f = ; char ch = getchar();
    for(; (ch < '' || ch > '') && ch != '-';  ch = getchar());
    if(ch == '-') f = -, ch = getchar();
    for(; ch >= '' && ch <= ''; ch = getchar())
        i = (i << ) + (i << ) + (ch - '');
    return i * f;
}

inline void wr(int x){
    if(x < ) putchar('-'), x = -x;
    if(x > ) wr(x / );
    putchar(x %  + '');
}

int main(){
    n = read(), m = read();
    for(int i = ; i <= n; i++) fa[i] = i;
    for(int i = ; i <= n; i++) nod[i] = newNode(read(), i);
    for(int i = ; i <= m; i++){
        int a = read(), b = read();
        int fu = getAnc(a), fv = getAnc(b);
        if(fu != fv){
            if(nod[fu]->pri < nod[fv]->pri) fa[fv] = fu, nod[fu] = Merge(nod[fu], nod[fv]);
            else fa[fu] = fv, nod[fv] = Merge(nod[fu], nod[fv]);
        }
    }
//    for(int i = 1; i <= n; i++) cout<<i<<":"<<nod[i]->sze<<endl;
    int Q = read();
    for(int i = ; i <= Q; i++){
        char opt[]; scanf("%s", opt);
        if(opt[] == 'Q'){
            node *L, *R, *p, *q;
            int x = read(), k = read(), fx = getAnc(x);
//            cout<<x<<" "<<k<<" "<<fx<<" "<<endl;
            Split_k(nod[fx], k - , L, R);
            Split_k(R, , p, q);
            if(p) wr(p->num);
            else wr(-);
            putchar('\n');
            nod[fx] = Merge2(L, Merge2(p, q));
        }
        else{
            int a = read(), b = read();
            int fu = getAnc(a), fv = getAnc(b);
            if(fu != fv){
                if(nod[fu]->pri < nod[fv]->pri) fa[fv] = fu, nod[fu] = Merge(nod[fu], nod[fv]);
                else fa[fu] = fv, nod[fv] = Merge(nod[fu], nod[fv]);
            }
        }
    }
    return ;
}