洛谷 - P1456 Monkey King

传送门：洛谷 - P1456

思路分析

每次打架就合并两个线段树，用并查集维护集合关系

AC代码

#include <bits/stdc++.h>
#define fi first
#define se second
#define ll long long
#define pb push_back
#define mp make_pair
#define fun function
#define sz(x) (x).size()
#define lowbit(x) (x)&(-x)
#define all(x) (x).begin(),(x).end()
#define mem(a,b) memset(a,b,sizeof(a))

namespace FastIO {
#define BUF_SIZE 100000
#define OUT_SIZE 100000
    bool IOerror=0;
    inline char nc() {
        static char buf[BUF_SIZE],*p1=buf+BUF_SIZE,*pend=buf+BUF_SIZE;
        if(p1==pend) {
            p1=buf;
            pend=buf+fread(buf,1,BUF_SIZE,stdin);
            if(pend==p1) {
                IOerror=1;
                return -1;
            }
        }
        return *p1++;
    }
    inline bool blank(char ch) {
        return ch==' '||ch=='\n'||ch=='\r'||ch=='\t';
    }
    template<class T> inline bool read(T &x) {
        bool sign=0;
        char ch=nc();
        x=0;
        for(; blank(ch); ch=nc());
        if(IOerror)return false;
        if(ch=='-')sign=1,ch=nc();
        for(; ch>='0'&&ch<='9'; ch=nc())x=x*10+ch-'0';
        if(sign)x=-x;
        return true;
    }
    template<class T,class... U>bool read(T& h,U&... t) {
        return read(h)&&read(t...);
    }
#undef OUT_SIZE
#undef BUF_SIZE
};
using namespace std;
using namespace FastIO;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int INF = 0x3f3f3f3f;
const int N = 1e5+10;

struct node{
    int sum,ls,rs;
}tree[N * 40];

int root[N],cnt,f[N];

int find(int x){
    return f[x]==x?x:f[x]=find(f[x]);
}

int newnode(){
    int x=++cnt;
    tree[x].ls=0;
    tree[x].rs=0;
    tree[x].sum=0;
    return x;
}

void ins(int &x,int l,int r,int pos){
    if(!x) x=newnode();
    tree[x].sum++;
    if(l==r) return ;
    int mid=l+r>>1;
    if(pos<=mid) ins(tree[x].ls,l,mid,pos);
    else ins(tree[x].rs,mid+1,r,pos);
} 

void del(int x,int l,int r,int pos){
    tree[x].sum--;
    if(l==r) return ;
    int mid=l+r>>1;
    if(pos<=mid) del(tree[x].ls,l,mid,pos);
    else del(tree[x].rs,mid+1,r,pos);
}

int merge(int x,int y){
    if( !x || !y ) return x?x:y;
    tree[x].sum=tree[x].sum+tree[y].sum;
    tree[x].ls=merge(tree[x].ls,tree[y].ls);
    tree[x].rs=merge(tree[x].rs,tree[y].rs);
    return x;
}

int query(int x,int l,int r){
    if(l==r) return l;
    int mid=l+r>>1;
    if(tree[tree[x].rs].sum) return query(tree[x].rs,mid+1,r);
    else return query(tree[x].ls,l,mid);
}

int tot=32768;

int main() {

#ifdef xiaofan
    freopen("1.in","r",stdin);
    freopen("1.out","w",stdout);
#endif

    int n;
    while(read(n)){
        cnt=0;
        mem(root,0);
        for(int i=0;i<=n;i++) f[i]=i;
        for(int i=1;i<=n;i++){
            int x;
            read(x);
            ins(root[i],1,tot,x);
        }
        int m;
        read(m);
        while(m--){
            int x,y;
            read(x,y);
            int fx=find(x);
            int fy=find(y);
            if(fx==fy){
                puts("-1");
                continue;
            }
            int a=query(root[fx],1,tot);
            int b=query(root[fy],1,tot);
            del(root[fx],1,tot,a);
            del(root[fy],1,tot,b);
            ins(root[fx],1,tot,a/2);
            ins(root[fy],1,tot,b/2);
            f[fx]=fy;
            root[fy]=merge(root[fx],root[fy]);
            printf("%d\n",query(root[fy],1,tot));
        }
    }




    return 0;
}