CF 609E （树链剖分+MST）

link

题意

询问每一条边强制作为MST上的边的 最小sum

做法

我们先跑出 MST 然后 如果是非树边就 加上 这条边减去 u到v的权值最大的边

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1000010;
int n, m;
struct node {
	int u, v, w, id, f = 0;
} e[N];
ll w[N];
vector<pair<int, int>> g[N];
ll son[N], id[N], wt[N], siz[N], f[N], top[N],  cnt;
int d[N];
int fa[N];
ll ans1;
ll ans[N];
struct seg_tree {
#define lc(x) x<<1
#define rc(x) x<<1|1
	int l, r;
	ll sum, maxv;
};
seg_tree t[N << 2];
void pushup (int p) {
	t[p].sum = t[lc(p)].sum + t[rc(p)].sum;
	t[p].maxv = max(t[lc(p)].maxv, t[rc(p)].maxv);
}
void build (int p, int l, int r) {
	t[p].l = l, t[p].r = r;
	if (l == r) {
		t[p].maxv = wt[l];
		return ;
	}
	int mid = l + r >> 1;
	build(lc(p), l, mid);
	build(rc(p), mid + 1, r);
	pushup(p);
}
void update (int p, int x, int v) {
	if (t[p].l == t[p].r && t[p].l == x) {
		t[p].maxv = v;
		t[p].sum = v;
		return ;
	}
	int mid = t[p].l + t[p].r >> 1;
	if (x <= mid) update(lc(p), x, v);
	if (x > mid) update(rc(p), x, v);
	pushup(p);
}
ll query_max (int p, int l, int r) {
	if (t[p].l >= l && t[p].r <= r) return t[p].maxv;
	int mid = t[p].l + t[p].r >> 1;
	ll maxv = -1e9;
	if (l <= mid) maxv = max(maxv, query_max(lc(p), l, r));
	if (r > mid) maxv = max(maxv, query_max(rc(p), l, r));
	return maxv;

}
ll query_sum (int p, int l, int r) {
	if (t[p].l >= l && t[p].r <= r) return t[p].sum;
	int mid = t[p].l + t[p].r >> 1;
	ll sum = 0;
	if (l <= mid) sum += query_sum(lc(p), l, r);
	if (r > mid) sum += query_sum(rc(p), l, r);
	return sum;
}
void dfs1(int u, int fa) {
	d[u] = d[fa] + 1;
	siz[u] = 1;
	int  ma = -1;
	f[u] = fa;
	for( pair<int, int> a : g[u]) {
		int v = a.first;
		int val = a.second;
		if(v == fa)continue;
		w[v] = val;
		dfs1(v, u);
		siz[u] += siz[v];
		if(siz[v] > ma) son[u] = v, ma = siz[v];
	}
}
void dfs2(int u, int topfather) {
	id[u] = ++cnt;
	wt[cnt] = w[u];
	top[u] = topfather;
	if(!son[u])return;
	dfs2(son[u], topfather);
	for(pair<int, int> a : g[u]) {
		int v = a.first;
		int val = a.second;
		if(v == f[u] || v == son[u])continue;
		dfs2(v, v);
	}

}
int  Qmax (int u, int v) {
	ll ans = -1e9;
	while(top[u] != top[v]) {
		if (d[top[u]] < d[top[v]]) swap(u, v);
		ans = max(ans, query_max(1, id[top[u]], id[u]));
		u = f[top[u]];
	}
	if (d[u] > d[v]) swap(u, v);
	ans = max(ans, query_max(1, id[son[u]], id[v]));
	return ans;
}
int find(int x) {
	return x == fa[x] ? x : fa[x] = find(fa[x]);
}
bool cmp(node a, node b) {
	return a.w < b.w;
}
int main() {
	cin >> n >> m;
	for(int i = 1; i <= m; i++) cin >> e[i].u >> e[i].v >> e[i].w;
	for(int i = 1; i <= m; i++) e[i].id = i,e[i].f=0;
	sort(e + 1, e + m + 1, cmp);
	for(int i = 1; i <= n; i++) fa[i] = i;
	for(int i = 1; i <= m; i++) {
		int a = find(e[i].u);
		int b = find(e[i].v);
		int w = e[i].w;
		if(a == b)continue;
		fa[a] = b;
		e[i].f = 1;
		ans1 += w;
		g[a].push_back({b, w});
		g[b].push_back({a, w});
	}
	dfs1(1, 1);
	dfs2(1, 1);
	build(1,1,n);
	for(int i = 1; i <= m; i++) {
		if(e[i].f) ans[e[i].id] = ans1;
		else ans[e[i].id] = ans1 + e[i].w - Qmax(e[i].u, e[i].v);
	}
	for(int i = 1; i <= m; i++) {
		cout << ans[i] << endl;
	}
}