CodeForces - 450D Jzzhu and Cities【Dijkstra + 删除特殊边】⭐

Jzzhu and Cities

---

题意： 给定一个无向图，图中有m条普通的公路和k条从1点出发的铁路。问在不影响从1点到所有点的最短路情况下，最多可以删除多少条铁路。

题解： 又犯了大忌，千万不要在Dij中添加太多的所谓限制条件，只会越搞越乱。办法就是记录下到某个点的最短路的条数。然后在保证条数大于0的情况下去删除铁路即可。

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int N = 2e5 + 10;
const int M = 7e5 + 10;
const int K = 1e5 + 10;

int n, m, k;
ll dis[N];
int vis[N];
int path[K];
int cnt, head[M];
vector<pair<int, ll> > load;
struct node{
	int id; ll w;
	bool operator<(const node &A)const{
		return A.w < w;}
};
struct edge{ int to, next; ll w;} e[M];
void add(int u, int v, ll w) { e[cnt].to = v, e[cnt].w = w, e[cnt].next = head[u], head[u] = cnt++;}
void addedge(int u, int v, ll w) { add(u, v, w); add(v, u, w);}

void dij() {
	for(int i = 0; i < N; i++)	vis[i] = 0, dis[i] = inf;
	priority_queue<node> Q;
	Q.push({1, 0}); dis[1] = 0;
	while(!Q.empty()) {
		node u = Q.top(); Q.pop();
		if(vis[u.id])	continue;
		vis[u.id] = 1;
		for(int i = head[u.id]; ~i; i = e[i].next) {
			int v = e[i].to, w = e[i].w;
			if(vis[v])	continue;
			if(dis[v] > u.w + w) {
				path[v] = 1;
				dis[v] = u.w + w;
				Q.push({v, dis[v]});
			} else if(dis[v] == u.w + w) {
				path[v]++;
			}
		}
	}
}

void solve() {
	int ans = 0;
	for(int i = 0; i < load.size(); i++) {
		int v = load[i].first, w = load[i].second;
		if(w > dis[v]) ans++;
		else if(w == dis[v]) {
			if(path[v] > 1) {
				ans++;
				path[v]--;
			}
		}
	}
	printf("%d\n", ans);
}

int main() {
	int u, v; ll w;
	for(int i = 0; i < M; i++) head[i] = -1;
	scanf("%d%d%d", &n, &m, &k);
	while(m--) {
		scanf("%d%d%lld", &u, &v, &w);
		addedge(u, v, w);
	}
	for(int i = 0; i < k; i++) {
		scanf("%d%lld", &v, &w);
		load.push_back({v, w});
		add(1, v, w);
	}
	dij();
	solve();
	return 0;
}