(有任何问题欢迎留言或私聊 && 欢迎交流讨论哦
Catalog
Problem:
原题目描述在最下面。
给定一个 n n n个点图, q q q次询问最小瓶颈路。
最小瓶颈路就是在两个结点之间求一条最长边最短的路径,而次小生成树则是所有生成树中权值排名第二的生成树(可以和最小生成树相等)(当然也有一个问题是求严格的次小生成树, 那么这个就不同了)
Solution:
裸题啊,自己敲一遍练练手咯
倍增加 L C A LCA LCA随便搞搞。
性质1: 最小瓶颈路的值一定在 M S T MST MST上。
所以就在 M S T MST MST上跑一遍树上倍增,记录最大权值。
询问的话,就在求LCA的同时,记录最大边权即可。
当然这题也可以用Kruskal重构树写,下面附上代码。
AC_Code:
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
#include <ctime>
#include <iostream>
#define lson(x) cw[x].l
#define rson(x) cw[x].r
using namespace std;
typedef long long LL;
const int MXN = 1e5 + 5;
const int MXE = 6e5 + 5;
const int INF = 0x3f3f3f3f;
int n, m;
int fa[MXN], FA[MXN], up[MXN][23], dis[MXN][23], dep[MXN];
int head[MXN], tot;
struct lp{
int v, w, nex;
}cw[MXE];
struct node{
int u, v, w;
}edge[MXE];
void init() {
tot = -1;
memset(head, -1, sizeof(head));
memset(dis, 0, sizeof(dis));
}
void dfs(int u,int ba,int d) {
fa[u] = up[u][0] = ba;
dep[u] = d;
for(int i = 1, cf; i < 20; ++i) {
cf =up[u][i-1];
up[u][i] = up[cf][i-1];
dis[u][i] = max(dis[u][i-1],dis[cf][i-1]);
}
for(int i = head[u]; ~i; i = cw[i].nex) {
int v = cw[i].v;
if(v == ba) continue;
dis[v][0] = cw[i].w;
up[v][0] = u;
dfs(v, u, d+1);
}
}
/*int LCA(int x,int y) {
int ans = 0;
if(dep[x] < dep[y]) swap(x, y);
int k = dep[x] - dep[y];
for(int i = 0; i < 20; ++i) {
if((1<<i)&k){
ans = max(ans, dis[x][i]);
x = up[x][i];
}
}
if(x != y){
for(int i = 19; i >= 0; --i) {
if(up[x][i] != up[y][i]) {
ans = max(ans, dis[x][i]);
ans = max(ans, dis[y][i]);
x = up[x][i]; y = up[y][i];
}
}
ans = max(ans, max(dis[x][0],dis[y][0]));
}
return ans;
}*/
int LCA(int x,int y) {
int ans = 0;
if(dep[x] < dep[y]) swap(x, y);
for(int i = 19; i >= 0; --i) {
if(dep[up[x][i]] >= dep[y]) {
ans = max(ans, dis[x][i]);
x = up[x][i];
}
}
if(x != y){
for(int i = 19; i >= 0; --i) {
if(up[x][i] != up[y][i]) {
ans = max(ans, dis[x][i]);
ans = max(ans, dis[y][i]);
x = up[x][i]; y = up[y][i];
}
}
ans = max(ans, max(dis[x][0],dis[y][0]));
}
return ans;
}
void add_edge(int u,int v,int w) {
cw[++tot].v = v; cw[tot].w = w; cw[tot].nex = head[u];
head[u] = tot;
cw[++tot].v = u; cw[tot].w = w; cw[tot].nex = head[v];
head[v] = tot;
}
bool cmp(node &a, node &b) {
return a.w < b.w;
}
int Fi(int x) {
return FA[x] == x? x: FA[x] = Fi(FA[x]);
}
int fuck = 0;
void solve() {
if(fuck) printf("\n");
init();
for(int i = 0; i < m; ++i) {
scanf("%d%d%d", &edge[i].u,&edge[i].v,&edge[i].w);
}
sort(edge, edge + m, cmp);
int CNT = 0;
for(int i = 1; i <= n; ++i) FA[i] = i;
for(int i = 0; i < m; ++i) {
int pa = Fi(edge[i].u), pb = Fi(edge[i].v);
if(pa == pb) continue;
FA[pb] = pa;
add_edge(edge[i].u,edge[i].v,edge[i].w);
CNT ++;
if(CNT == n - 1) break;
}
up[1][0] = 1;
//dis[1][0] = INF;
dfs(1, 1, 1);
int q, u, v;scanf("%d", &q);
while(q--) {
scanf("%d%d", &u, &v);
printf("%d\n", LCA(u, v));
}
fuck++;
}
int main(int argc, char const *argv[]){
while(~scanf("%d%d", &n, &m)) solve();
return 0;
}
Problem Description:
LCA模板
struct lp {
int v, nex;
int w;
} cw[MXE];
int tot, head[MXN];
namespace LCA {
int fa[MXN], sz[MXN], dep[MXN], son[MXN], top[MXN], dis[MXN];
void dfs1(int u,int ba,int d) {
dep[u] = d; fa[u] = ba; sz[u] = 1; son[u] = 0;
for(int i = head[u], v; ~i; i = cw[i].nex) {
v = cw[i].v;
if(v == ba) continue;
dis[v] = dis[u] + cw[i].w;
dfs1(v, u, d + 1);
sz[u] += sz[v];
if(sz[v] > sz[son[u]]) son[u] = v;
}
}
void rdfs(int u,int ba) {
if(son[u]) {
top[son[u]] = top[u];
rdfs(son[u], u);
}
for(int i = head[u], v; ~i; i = cw[i].nex) {
v = cw[i].v;
if(v == ba || v == son[u]) continue;
top[v] = v;
rdfs(v, u);
}
}
int lca(int x,int y) {
while(top[x] != top[y]) {
if(dep[top[x]] < dep[top[y]]) swap(x, y);
x = fa[top[x]];
}
return dep[x] < dep[y]? x: y;
}
int query(int x, int y) {
return dis[x] + dis[y] - 2 * dis[lca(x, y)];
}
void init() {
dfs1(1, 1, 1);
top[1] = 1;
rdfs(1, 1);
}
}
namespace LCA {
int dis[MXN], up[MXN][20], lens[MXN];
void dfs(int u, int ba, int d) {
up[u][0] = ba; lens[u] = d;
for(int i = 1; i < 20; ++i) up[u][i] = up[up[u][i-1]][i-1];
for(int i = head[u], v; ~i; i = cw[i].nex) {
v = cw[i].v;
if(v == ba) continue;
dis[v] = dis[u] + cw[i].w;
dfs(v, u, d + 1);
}
}
int lca(int x, int y) {
if(lens[x] < lens[y]) swap(x, y);
for(int i = 19; i >= 0; --i) {
if(lens[up[x][i]] >= lens[y]) {
x = up[x][i];
}
}
if(x == y) return x;
for(int i = 19; i >= 0; --i) {
if(up[x][i] != up[y][i]) {
x = up[x][i], y = up[y][i];
}
}
return up[x][0];
}
int query(int i, int j) {
return dis[i] + dis[j] - 2 * dis[lca(i, j)];
}
void init() {
dfs(1, 0, 0);
}
}
namespace LCA {
int dis[MXN], up[MXN][20], lg[MXN], DEP[MXN];
void dfs(int u, int ba) {
DEP[u] = DEP[ba] + 1;
for(int i = head[u], v; ~i; i = cw[i].nex) {
v = cw[i].v;
if(v == ba) continue;
dis[v] = dis[u] + cw[i].w, up[v][0] = u;
dfs(v, u);
}
}
void init() {
for (int i = 2; i <= n; ++i) lg[i] = lg[i / 2] + 1;;
dis[1] = 0;
dfs(1, -1);
for (int j = 1; j <= lg[n]; ++j)
for (int i = 1; i <= n; ++i) up[i][j] = up[up[i][j - 1]][j - 1];
}
int lca(int x, int y) {
if (DEP[x] > DEP[y]) swap(x, y);
int k = DEP[y] - DEP[x];
for (int i = 0; k; k = k / 2, ++i)
if (k & 1) y = up[y][i];
if (x == y) return x;
k = DEP[x];
for (int i = lg[k]; i >= 0; --i)
if (up[x][i] != up[y][i]) x = up[x][i], y = up[y][i];
return up[x][0];
}
int query(int i, int j) {
return dis[i] + dis[j] - 2 * dis[lca(i, j)];
}
}
namespace LCA {
int dis[MXN], up[MXN][20], lens[MXN];
int cnt, dfn[MXN], en[MXN], LOG[MXN];
void dfs(int u, int ba) {
lens[u] = lens[ba] + 1;
dfn[++cnt] = u;
en[u] = cnt;
for(int i = head[u], v; ~i; i = cw[i].nex) {
v = cw[i].v;
if(v == ba) continue;
dis[v] = dis[u] + cw[i].w;
dfs(v, u);
dfn[++ cnt] = u;
}
}
inline int cmp(int u, int v) {
return lens[u] < lens[v] ? u: v;
}
void init() {
cnt = 0;
dis[0] = lens[0] = 0;
dfs(1, 0);
LOG[1] = 0;
for(int i = 2; i <= cnt; ++i) LOG[i] = LOG[i-1] + ((1<<(LOG[i-1]+1))==i);
for(int i = 1; i <= cnt; ++i) up[i][0] = dfn[i];
for(int j = 1; (1<<j) <= cnt; ++j)
for(int i = 1; i + (1<<j) -1 <= cnt; ++i)
up[i][j] = cmp(up[i][j-1], up[i+(1<<(j-1))][j-1]);
}
inline int lca(int x, int y) {
int l = en[x], r = en[y];
if(l > r) swap(l, r);
int k = LOG[r - l + 1];
return cmp(up[l][k], up[r-(1<<k)+1][k]);
}
inline int query(int i, int j) {
return dis[i] + dis[j] - 2 * dis[lca(i, j)];
}
}
function<void(LL,LL)> dfs = [&](LL u, LL p) {
seg[u].first = ++step;
for(LL i = 0; i < G[u].size(); i++) {
LL &v = G[u][i];
if(v == p) continue;
dfs(v, u);
}
seg[u].second = step;
};
Kruskal重构树代码
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <stack>
#include <vector>
#define fi first
#define se second
#define iis std::ios::sync_with_stdio(false)
#define pb push_back
#define o2(x) (x)*(x)
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
const int MXN = 2e5 + 6;
const int INF = 0x3f3f3f3f;
const int mod = 998244353;
int n, m;
struct EDGE {
int u, v, w;
}node[MXN];
int fa[MXN], Rnk[MXN], val[MXN], inde;
std::vector<int> mp[MXN];
int up[MXN][20], dep[MXN];
bool cmp(const EDGE &A, const EDGE &B) {
return A.w < B.w;
}
int Fi(int x) {
return fa[x]==x?x:fa[x]=Fi(fa[x]);
}
void kruskal() {
sort(node, node + m, cmp);
int cnt = 0; inde = n;
for(int i = 1; i <= n; ++i) fa[i] = i, Rnk[i] = 0;
for(int i = 0; i < m; ++i) {
int pa = Fi(node[i].u), pb = Fi(node[i].v);
if(pa == pb) continue;
if(Rnk[pa] > Rnk[pb]) swap(pa, pb);
Rnk[pb] = max(Rnk[pb], Rnk[pa] + 1);
++ inde;
fa[inde] = inde; fa[pa] = inde; fa[pb] = inde;
mp[inde].push_back(pa);
mp[inde].push_back(pb);
val[inde] = node[i].w;
++ cnt;
if(cnt == n - 1) break;
}
}
void dfs(int u,int ba,int d) {
up[u][0] = ba;
dep[u] = d;
for(int i = 1, cf; i < 20; ++i) {
cf = up[u][i-1];
up[u][i] = up[cf][i-1];
}
int len = mp[u].size();
for(int i = 0; i < len; ++i) {
int v = mp[u][i];
dfs(v, u, d+1);
}
}
int lca(int x,int y) {
if(dep[x] < dep[y]) swap(x, y);
for(int i = 19; i >= 0; --i) {
if(dep[up[x][i]] >= dep[y]) {
x = up[x][i];
}
}
if(x == y) return x;
for(int i = 19; i >= 0; --i) {
if(up[x][i] != up[y][i]) {
x = up[x][i], y = up[y][i];
}
}
return up[x][0];
}
int main(){
int Q = -3;
while(~scanf("%d%d", &n, &m)){
if(Q != -3) printf("\n");
for(int i = 1; i <= 2*n+100; ++i) mp[i].clear();
for(int i = 0; i < m; ++i) {
scanf("%d%d%d", &node[i].u, &node[i].v, &node[i].w);
}
kruskal();
dfs(inde, inde, 1);
scanf("%d", &Q);
while(Q --) {
int u, v;
scanf("%d%d", &u, &v);
printf("%d\n", val[lca(u, v)]);
}
}
return 0;
}
本题按边权从小到大排序,构建 K r u s k a l Kruskal Kruskal重构树:
写法:
在
k
r
u
s
k
a
l
kruskal
kruskal连边时,新建一个点
x
x
x,作为点
u
u
u和
v
v
v的父节点,并且把与
u
u
u和
v
v
v相连接的点全部转移连接到
x
x
x上去。为了避免再连边的过程,可以借用
k
r
u
s
k
a
l
kruskal
kruskal的并查集优化掉。
性质:
1.二叉树,叶子节点为原来的点;非叶子节点都是新加的点。
2.这棵树是以最后新建的节点为根的有根树。
3.子节点的边权小于等于父节点的边权。边权越大的节点深度越小。
4.原树上两个点路径上最大边权的最小值 是 新树上两个点
L
C
A
LCA
LCA点的点权。(
l
c
a
lca
lca是两点路径上深度最小的点)
应用:
1.求两点路径上最大/小边权的最小/大值。
2.求所有从
u
u
u出发只经过边权不超过
x
x
x的边能到达的结点。
边权按升序排序建
k
u
a
s
k
a
l
kuaskal
kuaskal重构树,找到树上深度最小的,点权不超过
x
x
x的结点(一般用树上倍增)
那么它子树内的所有节点就是上述所求的。
若要求路径上最小边权的最大值,则改为按边权从大到小排序即可。
BZOJ3551 [ONTAK2010]Peaks加强版【Kruskal重构树+主席树+树上倍增】
[NOI2018 D1T1]归程【Kruskal重构树】