(有任何问题欢迎留言或私聊 && 欢迎交流讨论哦
Catalog
Problem:传送门
Portal
原题目描述在最下面。
给你一个带点权的森林,执行两种操作:连接两颗树和查询链上第
k
k
k小值。
Solution:
并查集按秩合并+主席树
因为每次合并两棵树都要重新遍历一遍某棵树来重构主席树,所以要用按秩合并优化这个过程。
就是每次把小的树接在大的树下面,然后遍历 r k rk rk小的树重构主席树即可。
因为这题要求是点权,所以每颗主席树记录的是从 u u u点到根节点路径上的点的点权。
当查询链上第 k k k小时,就是用 u + v − l c a − f a [ l c a ] u+v-lca-fa[lca] u+v−lca−fa[lca]的主席树的值来查询。
总的来说,写起来没啥难度,看代码注释吧。就是有点细节和坑点,比如这题是单组输入,但你会误以为是
t
t
t多组输入。
AC_Code:
#include<bits/stdc++.h>
#define fi first
#define se second
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
const int INF = 0x3f3f3f3f;
const int MXN = 1e6 + 7;
const int mod = 998244353;
int n, m, T, ALL;
int ar[MXN], fa[MXN], rk[MXN], br[MXN];//并查集和离散化用的
int up[MXN][22],dep[MXN];//求lca用的
struct lp {//主席树
int l, r, sum;
}cw[MXN*20];
int Root[MXN], tot_z;
struct node {//建图
int v, nex;
}edge[MXN];
int head[MXN], tot_b;
void add_edge(int a, int b) {
edge[++tot_b] = {b, head[a]}; head[a] = tot_b;
edge[++tot_b] = {a, head[b]}; head[b] = tot_b;
}
int Fi(int x) {
return fa[x]==x?x:fa[x]=Fi(fa[x]);
}
void un(int a, int b) {//按秩合并
int pa = Fi(a), pb = Fi(b);
if(pa == pb) return;
if(rk[pa] < rk[pb]) swap(pa, pb);
fa[pb] = pa;
rk[pa] += rk[pb];
}
void update(int l, int r, int old, int &cur, int p) {
cw[++tot_z] = cw[old];
cur = tot_z;
++ cw[cur].sum;
if(l == r) return;
int mid = (l + r) >> 1;
if(p <= mid) update(l,mid,cw[old].l,cw[cur].l,p);
else update(mid+1,r,cw[old].r,cw[cur].r,p);
}
void build(int u, int ba, int d) {//重构主席树
update(1, ALL, Root[ba], Root[u], ar[u]);
up[u][0] = ba; dep[u] = d;
//printf("u = %d bad = %d\n", u, ba);
for(int i = 1; i <= 20; ++i) up[u][i] = up[up[u][i-1]][i-1];
for(int i = head[u]; ~i; i = edge[i].nex) {
int v = edge[i].v;
if(v == ba) continue;
build(v, u, d+1);
}
}
int LCA(int x,int y) {
if(dep[x] < dep[y]) swap(x, y);
for(int i = 20; i >= 0; --i) {
if(dep[up[x][i]] >= dep[y]) x = up[x][i];
}
if(x == y) return x;
for(int i = 20; i >= 0; --i) {
if(up[x][i] != up[y][i]) {
x = up[x][i], y = up[y][i];
}
}
return up[x][0];
}
int z_query(int l,int r,int u,int v,int lca,int faLCA,int k) {
if(l == r) return l;
int mid = (l + r) >> 1;
int sum = cw[cw[u].l].sum+cw[cw[v].l].sum-cw[cw[lca].l].sum-cw[cw[faLCA].l].sum;
if(sum >= k) return z_query(l,mid,cw[u].l,cw[v].l,cw[lca].l,cw[faLCA].l,k);
else {
return z_query(mid+1,r,cw[u].r,cw[v].r,cw[lca].r,cw[faLCA].r,k-sum);
}
}
int main() {
cw[0] = {0, 0, 0};
tot_b = -1; memset(head, -1, sizeof(head));
scanf("%d", &n);
scanf("%d%d%d", &n, &m, &T);
for(int i = 1; i <= n; ++i) {
scanf("%d", &ar[i]);
br[i] = ar[i];
fa[i] = i; rk[i] = 1;
}
sort(br + 1, br + 1 + n);
ALL = unique(br + 1, br + 1 + n) - br - 1;//离散化
for(int i = 1; i <= n; ++i) ar[i] = lower_bound(br+1,br+ALL+1,ar[i])-br;
for(int i = 0, a, b, c; i < m; ++i) {
scanf("%d%d", &a, &b);
add_edge(a, b);
un(a, b);
}
for(int i = 1; i <= n; ++i) {//建出森林里的主席树
if(Fi(i) == i) build(i, 0, 1);
}
int lastans = 0, x, y, k;
char s[10];
while(T --) {
scanf("%s", s);
if(s[0] == 'Q') {
scanf("%d%d%d", &x, &y, &k);
x ^= lastans;y ^= lastans;k ^= lastans;
int lca = LCA(x, y), faLCA = up[lca][0];
x = Root[x], y = Root[y], lca = Root[lca], faLCA = Root[faLCA];
int ANS = z_query(1,ALL,x,y,lca,faLCA,k);//查询第k小
//if(ANS < 0 || ANS > ALL) while(1);
lastans = br[ANS];
printf("%d\n", lastans);
}else {
scanf("%d%d", &x, &y);
x ^= lastans;y ^= lastans;
int px = Fi(x), py = Fi(y);
if(rk[px] < rk[py]) {//把小的接在大的下面
build(x, y, dep[y]+1);
}else {
build(y, x, dep[x]+1);
}
un(x, y);//别忘了合并和连边
add_edge(x, y);
}
//printf("lastans %d\n", lastans);
}
return 0;
}