1029 Median

1030 Travel Plan

题目大意

求最短路径的变形，不过如果路径相等时，需要找最小花费，已经需要知道最终结点的前驱路径

算法思想

• 变形的dijkstra就能求出
• 需要在路径相等时做个判断，以及在更新其他结点信息时，需要更新前驱数组

代码

#include<iostream>
#include<vector>
#include<string>
using namespace std;
#define intmax 99999999
struct road {
	int dis = intmax, cost = intmax;
};
vector<vector<road>>pop;
vector<bool>city;
vector<int>pre;
vector<road>dist;
void dijkstra(int s){//变形dijkstra，需要知道每个结点前驱及比较花费
	dist[s].dis = 0;
	dist[s].cost = 0;
	while (1) {
		int u = -1, min = intmax;
		for (int i = 0; i < city.size(); i++) {//找到当前最小距离
			if (!city[i] && dist[i].dis < min){
				u = i;
				min = dist[i].dis;
			}
		}
		if (u == -1)//已经取完
			break;
		city[u] = true;
		for (int v = 0; v < city.size(); v++){//更新相邻结点
			if (!city[v] && dist[v].dis > dist[u].dis + pop[u][v].dis){
				dist[v].dis = dist[u].dis + pop[u][v].dis;
				dist[v].cost = dist[u].cost + pop[u][v].cost;
				pre[v] = u;
			}
			else if (!city[v] && dist[v].dis == dist[u].dis + pop[u][v].dis){//当路程相等
				if (dist[u].cost + pop[u][v].cost < dist[v].cost) {//花费少则更新
					dist[v].cost = dist[u].cost + pop[u][v].cost;
					dist[v].dis = dist[u].dis + pop[u][v].dis;
					pre[v] = u;
				}
			}
		}
	}
	return;
}
int main() {
	int n, m, s, d, c1, c2, ds, dc, k;
	cin >> n >> m >> s >> d;
	city.resize(n,false);
	pop.resize(n);
	pre.resize(n);
	dist.resize(n);
	for (int i = 0; i < n; i++)
		pop[i].resize(n);
	for (int i = 0; i < m; i++){
		cin >> c1 >> c2 >> ds >> dc;
		pop[c1][c2].dis = ds;
		pop[c1][c2].cost = dc;
		pop[c2][c1].dis = ds;
		pop[c2][c1].cost = dc;
	}
	dijkstra(s);
	string l = to_string(d);//求路径
	k = d;
	while (1) {
		k = pre[k];
		l = to_string(k)+" " + l;
		if (k == s)
			break;
	}
	cout << l << " " << dist[d].dis << " " << dist[d].cost;
	return 0;
}