【题解】CF570E：Breaking Good

原题传送门
比较好的最短路题目
需要求最短路情况下修改路通断状态数最少
想到跑最短路的过程中记两个变量
$dis,safe$分别表示到该点的最短路以及最短路情况下路径上最多通边条数
显然使得路径上通边最多那么就能使得没经过的边集中断边最多

然后记录一个路径的pre把路径存下来，最终统计答案即可
Code：

#include <bits/stdc++.h>
#define maxn 100010
using namespace std;
struct Edge{
	int to, next, safe;
}edge[maxn << 1];
struct Line{
	int x, y, safe;
}line[maxn], print[maxn];
struct node{
	int val, len, safe;
	bool operator < (const node &x) const{ return x.len == len ? x.safe > safe : x.len < len; }
};
int num, head[maxn], n, m, ans, vis[maxn], dis[maxn], safe[maxn], pre[maxn];
priority_queue <node> q;

inline int read(){
	int s = 0, w = 1;
	char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') w = -1;
	for (; isdigit(c); c = getchar()) s = (s << 1) + (s << 3) + (c ^ 48);
	return s * w;
}

void addedge(int x, int y, int z){ edge[++num] = (Edge){y, head[x], z}, head[x] = num; }

int main(){
	n = read(), m = read();
	for (int i = 1; i <= m; ++i){
		int x = read(), y = read(), z = read();
		addedge(x, y, z), addedge(y, x, z);
		line[i] = (Line){x, y, z};
	}
	for (int i = 2; i <= n; ++i) dis[i] = 1e9;
	q.push((node){1, 0, 0});
	while (!q.empty()){
		node tmp = q.top(); q.pop();
		int u = tmp.val;
		if (vis[u]) continue;
		vis[u] = 1; 
		for (int i = head[u]; i; i = edge[i].next){
			int v = edge[i].to;
			if (dis[v] > dis[u] + 1){
				dis[v] = dis[u] + 1, safe[v] = safe[u] + edge[i].safe, pre[v] = u;
				if (!vis[v]) q.push((node){v, dis[v], safe[v]});
			} else
			if (dis[v] == dis[u] + 1 && safe[v] < safe[u] + edge[i].safe){
				safe[v] = safe[u] + edge[i].safe, pre[v] = u;
				if (!vis[v]) q.push((node){v, dis[v], safe[v]});
			}
		}
	}
	memset(vis, 0, sizeof(vis));
	for (int i = n; i; i = pre[i]) vis[i] = 1;
	for (int i = 1; i <= m; ++i)
		if (vis[line[i].x] && vis[line[i].y]){
			if (!line[i].safe) print[++ans] = line[i];
		} else if (line[i].safe) print[++ans] = line[i];
	printf("%d\n", ans);
	for (int i = 1; i <= ans; ++i) printf("%d %d %d\n", print[i].x, print[i].y, print[i].safe ^ 1);
	return 0;
}