题意:一开始有n个数,有两种操作,0 a b表示将a所在组和b所在组合并,1 a表示查询当前的第k大组数有多少个。
思路:合并集合很简单用并查集即可。查询的方法是:用树状数组记录数集中某个数出现次数,即tree[i]表示含有i个数的组有多少个。查找的时候二分即可。
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <cstdlib>
using namespace std;
#define clc(s,t) memset(s,t,sizeof(s))
#define INF 0x3fffffff
#define N 200005
int f[N],num[N],tree[N];
int n,q;
int lowbit(int x){
return x&(-x);
}
void add(int i,int x){
for(int j = i;j<=n;j+=lowbit(j))
tree[j] += x;
}
int sum(int x){
int i,res=0;
for(i = x;i>=1;i-=lowbit(i))
res += tree[i];
return res;
}
int find(int x){
if(f[x] == x)
return x;
return f[x] = find(f[x]);
}
int main(){
clc(tree, 0);
scanf("%d %d",&n,&q);
for(int i = 1;i<=n;i++){
f[i] = i;
num[i] = 1;
}
add(1, n);
while (q--) {
int i,j,cmd,a,b,low,high,mid;
scanf("%d",&cmd);
if(cmd){
scanf("%d",&a);
low = 1; //二分找第a大数
high = n;
while(low < high){
mid = (low+high)>>1;
j = sum(n)-sum(mid);
if(j < a)
high = mid;
else
low = mid+1;
}
printf("%d\n",low);
}else{
scanf("%d %d",&a,&b);
i = find(a);
j = find(b);
if(i == j) //一开始没加这个,贡献了WA
continue;
add(num[i], -1);
add(num[j], -1);
add(num[i]+num[j], 1);
f[i] = j;
num[j] += num[i];
}
}
}