图论小tip

CF1433G

题意：给定一个无向带权图，你能使一条边的边权权变为 0，求 n 组点对最短路之和最小值

假设这两个点为 x, y 。且必须经过点 u 到点 v 这条边，那我们就可以把 x 到 y 的最短路分成三段
dis[x, u] + dis[u, v] + dis[v, y]
修改的时候直接对其中一段进行操作就行了
（注意无向图要注意修改的先后顺序）

#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
const int N = 1010;

int n, m, k, U[N], V[N], a[N], b[N];
int dis[N][N], vis[N], minn = 1e9 + 10;
struct Edge {
	int nxt, to, W;
}edge[N << 1];
int head[N], tot;

inline void add(int x, int y, int z) {
	edge[++tot].to = y;
	edge[tot].W = z;
	edge[tot].nxt = head[x];
	head[x] = tot;
}
priority_queue<pii, vector<pii>, greater<pii> > q;
void dij(int s) {
	for(int i = 1; i <= n; i ++ ) dis[s][i] = 1e9 + 10, vis[i] = 0;
	dis[s][s] = 0;
	q.push(make_pair(dis[s][s], s));
	while(!q.empty()) {
		int u = q.top().second; q.pop();
		if(vis[u]) continue;
		vis[u] = 1;
		for(int i = head[u]; i; i = edge[i].nxt) {
			int v = edge[i].to;
			if(dis[s][v] > dis[s][u] + edge[i].W) {
				dis[s][v] = dis[s][u] + edge[i].W;
				q.push(make_pair(dis[s][v], v));
			}
		}
	}
}
int main () {
	scanf("%d %d %d", &n, &m, &k);
	for(int i = 1; i <= m; i ++ ) {
		int w; scanf("%d %d %d", &U[i], &V[i], &w);
		add(U[i], V[i], w), add(V[i], U[i], w);
	}
	for(int i = 1; i <= k; i ++ ) {
		scanf("%d %d", &a[i], &b[i]);
	}
	for(int i = 1; i <= n; i ++ ) dij(i);
	int res = 0;
	for(int i = 1; i <= k; i ++ ) res += dis[a[i]][b[i]];
	for(int i = 1; i <= m; i ++ ) {
		int num = res;
		int u = U[i], v = V[i];
		for(int j = 1; j <= k; j ++ ) {
			int x = a[j], y = b[j];
			int Num = dis[x][y] - min(dis[x][u] + dis[v][y], dis[x][v] + dis[u][y]);
			Num = max(0, Num);
			num -= Num;
		}
		minn = min(minn, num);
	}
	printf("%d\n", minn);
	return 0;
}