bzoj3123: [Sdoi2013]森林
如果没有连边的话,直接树上主席树二分即可。
考虑连边用启发式合并。
#pragma GCC optimize(2)
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100005;
struct node {
int to, next;
} edge[MAXN*2];
int head[MAXN], top = 0;
inline void push(int i, int j)
{ edge[++top] = (node) {j, head[i]}, head[i] = top; }
int fa[MAXN][20];
int depth[MAXN];
int lc[MAXN*400], rc[MAXN*400], dat[MAXN*400], tot = 0;
int n, m, t, testcase;
int rt[MAXN];
int dx[MAXN], dx_top = 0, a[MAXN];
void push(int pre, int &nd, int opl, int opr, int pos)
{
nd = ++tot;
register int tmp = nd;
while (1) {
lc[tmp] = lc[pre], rc[tmp] = rc[pre], dat[tmp] = dat[pre]+1;
int mid = (opl+opr)>>1;
if (opl < opr) {
if (pos <= mid) pre = lc[pre], lc[tmp] = ++tot, tmp = tot, opr = mid;
else pre = rc[pre], rc[tmp] = ++tot, tmp = tot, opl = mid+1;
} else break;
}
}
void rebuild(int nd, int f)
{
fa[nd][0] = f, depth[nd] = depth[f]+1;
for (register int i = 1; i <= 17; i++) fa[nd][i] = fa[fa[nd][i-1]][i-1];
push(rt[f], rt[nd], 1, dx_top, a[nd]);
for (register int i = head[nd]; i; i = edge[i].next) {
int to = edge[i].to;
if (to == f) continue;
rebuild(to, nd);
}
}
int lca(int a, int b)
{
if (depth[a] < depth[b]) swap(a, b);
for (register int j = 0, d = depth[a]-depth[b]; j <= 17; j++)
if (d&(1<<j))
a = fa[a][j];
if (a == b) return a;
for (register int i = 17; i >= 0; i--)
if (fa[a][i] != fa[b][i])
a = fa[a][i], b = fa[b][i];
return fa[a][0];
}
int query(int a, int b, int k)
{
int c = lca(a, b), d = fa[c][0];
a = rt[a], b = rt[b], c = rt[c], d = rt[d];
int L = 1, R = dx_top, mid;
while (L != R) {
mid = (L+R)>>1;
int T = dat[lc[a]]+dat[lc[b]]-dat[lc[c]]-dat[lc[d]];
if (T >= k) R = mid, a = lc[a], b = lc[b], c = lc[c], d = lc[d];
else L = mid+1, a = rc[a], b = rc[b], c = rc[c], d = rc[d], k -= T;
}
return dx[L];
}
int father[MAXN], siz[MAXN];
inline int findf(int nd)
{ return father[nd]?father[nd]=findf(father[nd]):nd; }
void link(int x, int y)
{
int a = findf(x), b = findf(y);
if (siz[a] < siz[b]) swap(a, b), swap(x, y);
push(x, y), push(y, x);
rebuild(y, x);
siz[a] += siz[b], father[b] = a;
}
inline int read()
{
register int a = 0, c;
do c = getchar(); while (!isdigit(c));
while (isdigit(c)) {
a = a*10+c-'0';
c = getchar();
}
return a;
}
int main()
{
scanf("%d", &testcase);
scanf("%d%d%d", &n, &m, &t);
for (register int i = 1; i <= n; i++) a[i] = read(), dx[++dx_top] = a[i];
sort(dx+1, dx+dx_top+1), dx_top = unique(dx+1, dx+dx_top+1)-dx-1;
for (register int i = 1; i <= n; i++) a[i] = lower_bound(dx+1, dx+dx_top+1, a[i])-dx;
for (register int i = 1; i <= m; i++) {
int x = read(), y = read();
push(x, y), push(y, x), x = findf(x), y = findf(y);
if (father[x] != y) father[x] = y;
}
for (register int i = 1; i <= n; i++)
if (father[i] == 0) {
rebuild(i, 0);
}
int lastans = 0;
char c;
int x, y, k;
while (t--) {
scanf("\n%c", &c);
if (c == 'Q') {
x = read(), y = read(), k = read(), x ^= lastans, y ^= lastans, k ^= lastans;
lastans = query(x, y, k);
printf("%d\n", lastans);
} else {
x = read(), y = read(), x ^= lastans, y ^= lastans;
link(x, y);
}
}
return 0;
}