[HNOI2012]永无乡【平衡树】【并查集】【启发式合并】

>Link

luogu P3224

---

>Description

给出$n$个点，进行$q$次操作：

1. 操作1：把两个点连起来
2. 操作2：询问与$x$相连通的点中$val$第$y$大的是哪个点

$1\le m\le n\le 10^5,1\le q\le 3\times 10^5$

---

>解题思路

感觉这道紫题还蛮友好的QAQ

相连通肯定用并查集，动态插入点+询问第$k$大就是用平衡树了
并查集如何把两棵平衡树并在一起？
就是用启发式合并，把小树并在大树上，这样可以降低时间复杂度；并的时候暴力把小树上的每个点加进大树就好了
总的时间复杂度大概为$O(nlo{g}^{2}n)$QAQ

平衡树我是用treap

---

>代码

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define N 100010
using namespace std;

int n, m, val[N], siz[N], dat[N], son[N][5], fa[N], root[N], q;
char cc;

int find (int x)
{
	if (fa[x] == x) return x;
	return fa[x] = find (fa[x]);
}
void update (int x) {siz[x] = siz[son[x][0]] + siz[son[x][1]] + 1;}
void spin (int &i, int x)
{
	int t = son[i][x];
	son[i][x] = son[t][!x];
	son[t][!x] = i;
	update (i);
	update (t);
	i = t;
}
void insert (int x, int &i)
{
	if (!i)
	{
		i = x, siz[i] = 1;
		return;
	}
	if (val[x] <= val[i])
	{
		insert (x, son[i][0]);
		if (dat[son[i][0]] < dat[i]) spin (i, 0);
	}
	else
	{
		insert (x, son[i][1]);
		if (dat[son[i][1]] < dat[i]) spin (i, 1);
	}
	update (i);
}
void dfs (int now, int &rot)
{
	if (!now) return;
	dfs (son[now][0], rot);
	dfs (son[now][1], rot);
	insert (now, rot); //从下往上加，不然深搜son会出错
}
void connect (int x, int y)
{
	if (!x || !y) return;
	int xx = find (x), yy = find (y);
	if (xx == yy) return;
	if (siz[root[xx]] < siz[root[yy]]) swap (xx, yy);
	dfs (root[yy], root[xx]);
	fa[root[xx]] = fa[xx] = fa[yy] = root[xx]; //全部指向每棵树的根，这样好维护
}
int askval (int x, int k)
{
	if (k == siz[son[x][0]] + 1) return x;
	if (k <= siz[son[x][0]]) return askval (son[x][0], k);
	else return askval (son[x][1], k - siz[son[x][0]] - 1);
}

int main()
{
	int u, v;
	scanf ("%d%d", &n, &m);
	for (int i = 1; i <= n; i++) scanf ("%d", &val[i]);
	for (int i = 1; i <= n; i++)
	  fa[i] = i, siz[i] = 1, dat[i] = rand(), root[i] = i;
	for (int i = 1; i <= m; i++)
	{
		scanf ("%d%d", &u, &v);
		connect (u, v);
	}
	scanf ("%d", &q);
	for (int i = 1; i <= q; i++)
	{
		cc = getchar();
		while (cc != 'B' && cc != 'Q') cc = getchar();
		scanf ("%d%d", &u, &v);
		if (cc == 'B') connect (u, v);
		else
		{
			int ans = askval (root[find (u)], v);
			if (!ans) printf ("-1\n");
			else printf ("%d\n", ans);
		}
	}
	return 0;
}