题解
模板题。dijkstra
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<vector>
using namespace std;
const int MAXN = 510;
const int INF = 0x3f3f3f3f;
int e[MAXN][MAXN], dis[MAXN], cost[MAXN][MAXN], dist[MAXN];
bool vis[MAXN];
int pre[MAXN];
vector<int> path, temppath;
int mincost = INF;
int n, m, s, d;
void dfs(int u) {
path.push_back(u);
if(u == s) return;
dfs(pre[u]);
}
int main() {
fill(dis, dis + MAXN, INF);
fill(e[0], e[0] + MAXN * MAXN, INF);
fill(dist, dist + MAXN, INF);
scanf("%d%d%d%d", &n, &m, &s, &d);
int a, b, c, t;
for(int i = 0; i < m; ++i) {
scanf("%d%d%d%d", &a, &b, &c, &t);
e[a][b] = e[b][a] = c;
cost[a][b] = cost[b][a] = t;
}
dis[s] = 0, dist[s] = 0;
for(int i = 0; i < n; ++i) {
int u = -1, minn = INF;
for(int j = 0; j < n; ++j) if(vis[j] == false && dis[j] < minn) {
u = j;
minn = dis[j];
}
if(u == -1) break;
vis[u] = true;
for(int v = 0; v < n; ++v) if(vis[v] == false) {
if(dis[v] > dis[u] + e[u][v]) {
dis[v] = dis[u] + e[u][v];
dist[v] = dist[u] + cost[u][v];
pre[v] = u;
} else if(dis[v] == dis[u] + e[u][v] && dist[v] > dist[u] + cost[u][v]) {
pre[v] = u;
dist[v] = dist[u] + cost[u][v];
}
}
}
dfs(d);
for(int i = path.size() - 1; i >= 0; --i) printf("%d ", path[i]);
printf("%d %d", dis[d], dist[d]);
return 0;
}