PAT--1030. Travel Plan(最短路)
来源:互联网 发布:网络点击率最高电视 编辑:程序博客网 时间:2024/05/16 15:05
A traveler’s map gives the distances between cities along the highways, together with the cost of each highway. Now you are supposed to write a program to help a traveler to decide the shortest path between his/her starting city and the destination. If such a shortest path is not unique, you are supposed to output the one with the minimum cost, which is guaranteed to be unique.
Input Specification:
Each input file contains one test case. Each case starts with a line containing 4 positive integers N, M, S, and D, where N (<=500) is the number of cities (and hence the cities are numbered from 0 to N-1); M is the number of highways; S and D are the starting and the destination cities, respectively. Then M lines follow, each provides the information of a highway, in the format:
City1 City2 Distance Cost
where the numbers are all integers no more than 500, and are separated by a space.
Output Specification:
For each test case, print in one line the cities along the shortest path from the starting point to the destination, followed by the total distance and the total cost of the path. The numbers must be separated by a space and there must be no extra space at the end of output.
Sample Input
4 5 0 3
0 1 1 20
1 3 2 30
0 3 4 10
0 2 2 20
2 3 1 20
Sample Output
0 2 3 3 40
题解
在所有从s到t的最短路中,选择cost最小的那条,并输出路径。
#include <bits/stdc++.h>using namespace std;const int maxn = 505;const int inf = 0x3f3f3f3f;int n, m, s, t;int dis[maxn][maxn], cost[maxn][maxn];int d[maxn], c[maxn], path[maxn], vis[maxn];void dfs(int u){ if(u == s){ printf("%d", s); return; } dfs(path[u]); printf(" %d", u);}void sol(){ for(int i = 0; i < n; ++i) d[i] = inf, c[i] = inf, path[i] = -1; d[s] = c[s] = 0; for(int i = 0; i < n; ++i){ int x, m = inf; for(int j = 0; j < n; ++j){ if(!vis[j] && d[j] < m) m = d[x = j]; } vis[x] = 1; for(int y = 0; y < n; ++y){ if(!vis[y] && dis[x][y]){ if(d[y] > d[x] + dis[x][y]){ d[y] = d[x] + dis[x][y]; c[y] = c[x] + cost[x][y]; path[y] = x; }else if(d[y] == d[x] + dis[x][y] && c[y] > c[x] + cost[x][y]){ c[y] = c[x] + cost[x][y]; path[y] = x; } } } } dfs(t); printf(" %d %d\n", d[t], c[t]);}int main(){ scanf("%d %d %d %d", &n, &m, &s, &t); int u, v, dd, cc; for(int i = 0; i < m; ++i){ scanf("%d %d %d %d", &u, &v, &dd, &cc); dis[u][v] = dis[v][u] = dd; cost[u][v] = cost[v][u] = cc; } sol(); return 0;}
- PAT--1030. Travel Plan(最短路)
- PAT 1030. Travel Plan (30) (最短路)
- 1030. Travel Plan (30)【最短路+路径记忆】——PAT (Advanced Level) Practise
- PAT 1030. Travel Plan
- 【PAT】1030. Travel Plan
- 1030. Travel Plan (30)-PAT
- 1030. Travel Plan (30) PAT
- PAT 1030. Travel Plan (30)
- PAT 1030. Travel Plan (30)
- PAT 1030. Travel Plan (30)
- 【PAT】1030. Travel Plan (30)
- pat 1030. Travel Plan (30)
- PAT 1030. Travel Plan (30)
- PAT(甲级)1030 Travel Plan(带两个权值的最短路)
- PAT 1030 Travel Plan dijkstra算法+双最短条件+保存最短路
- 【PAT Advanced Level】1030. Travel Plan (30)
- 浙大PAT 1030题 1030. Travel Plan
- PAT 1030. Travel Plan (30) 图论
- CodeForces
- kaldi的timit例子运行到SGMM2 Training & Decoding部分突然中断
- Java中repalceAll只替换第二个匹配到的字符串
- ubuntu快捷键
- vector<bool>的学习
- PAT--1030. Travel Plan(最短路)
- 28、几何算法-线段相交、凸包、球面弧长
- S2B2C模式学习总结
- ORACLE 树形遍历查询根节点、父节点、子节点
- 文件上传框样式美化
- UVA
- SQL Map XML配置文件。
- 2017年8月读书笔记
- QML与C++中信号和槽的使用