hdu 1385(最短路+输出路径)
来源:互联网 发布:手机怎么添加wifi网络 编辑:程序博客网 时间:2024/04/30 02:14
Minimum Transport Cost
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Problem Description
These are N cities in Spring country. Between each pair of cities there may be one transportation track or none. Now there is some cargo that should be delivered from one city to another. The transportation fee consists of two parts:
The cost of the transportation on the path between these cities, and
a certain tax which will be charged whenever any cargo passing through one city, except for the source and the destination cities.
You must write a program to find the route which has the minimum cost.
The cost of the transportation on the path between these cities, and
a certain tax which will be charged whenever any cargo passing through one city, except for the source and the destination cities.
You must write a program to find the route which has the minimum cost.
Input
First is N, number of cities. N = 0 indicates the end of input.
The data of path cost, city tax, source and destination cities are given in the input, which is of the form:
a11 a12 ... a1N
a21 a22 ... a2N
...............
aN1 aN2 ... aNN
b1 b2 ... bN
c d
e f
...
g h
where aij is the transport cost from city i to city j, aij = -1 indicates there is no direct path between city i and city j. bi represents the tax of passing through city i. And the cargo is to be delivered from city c to city d, city e to city f, ..., and g = h = -1. You must output the sequence of cities passed by and the total cost which is of the form:
The data of path cost, city tax, source and destination cities are given in the input, which is of the form:
a11 a12 ... a1N
a21 a22 ... a2N
...............
aN1 aN2 ... aNN
b1 b2 ... bN
c d
e f
...
g h
where aij is the transport cost from city i to city j, aij = -1 indicates there is no direct path between city i and city j. bi represents the tax of passing through city i. And the cargo is to be delivered from city c to city d, city e to city f, ..., and g = h = -1. You must output the sequence of cities passed by and the total cost which is of the form:
Output
From c to d :
Path: c-->c1-->......-->ck-->d
Total cost : ......
......
From e to f :
Path: e-->e1-->..........-->ek-->f
Total cost : ......
Note: if there are more minimal paths, output the lexically smallest one. Print a blank line after each test case.
Path: c-->c1-->......-->ck-->d
Total cost : ......
......
From e to f :
Path: e-->e1-->..........-->ek-->f
Total cost : ......
Note: if there are more minimal paths, output the lexically smallest one. Print a blank line after each test case.
Sample Input
50 3 22 -1 43 0 5 -1 -122 5 0 9 20-1 -1 9 0 44 -1 20 4 05 17 8 3 11 33 52 4-1 -10
Sample Output
From 1 to 3 :Path: 1-->5-->4-->3Total cost : 21From 3 to 5 :Path: 3-->4-->5Total cost : 16From 2 to 4 :Path: 2-->1-->5-->4Total cost : 17
解题思路:
这题我一开始用迪杰斯特拉,然后在进行松弛操作时用set记录更新其的父节点,set会自动排序,所以第一个数会是字典序最小的,接着逆着找即可。
但这样做会出现bug,因为字典序的比较是按位来一个个比较,如果只靠其父亲节点是无法保证一定是最小字典序的。
正解:Floyd,path[i][j]表示从i->j所经过的第一个点。接下来松弛操作就更新其即可。
WA:
#include<iostream>#include<cstdio>#include<cstring>#include<set>using namespace std;const int maxn = 105;const int inf = 0x3f3f3f3f;int n,map[maxn][maxn],dis[maxn],cost[maxn],res[maxn];bool vis[maxn];set<int> Set[maxn];void Dijkstra(int s){int k,MIN;memset(vis,false,sizeof(vis));for(int i = 1; i <= n; i++)if(i != s){dis[i] = map[s][i] + cost[i];Set[i].insert(s);}vis[s] = true;for(int i = 1; i < n; i++){MIN = inf;for(int j = 1; j <= n; j++){if(vis[j] == true) continue;if(MIN > dis[j]){MIN = dis[j];k = j;}}vis[k] = true;for(int j = 1; j <= n; j++){if(vis[j] == true || dis[j] < dis[k] + map[k][j] + cost[j]) continue;if(dis[j] > dis[k] + map[k][j] + cost[j]){dis[j] = dis[k] + map[k][j] + cost[j];Set[j].clear();}Set[j].insert(k);printf("%d %d:\n",k,j);set<int>::iterator it;for(it = Set[j].begin(); it != Set[j].end(); it++)printf("%d ",*it);printf("\n");}}}void dfs(int u,int deep){set<int>::iterator it = Set[u].begin();if(it == Set[u].end()){if(deep == 0)printf("%d",u);else printf("%d-->",u);return;}dfs(*it,deep+1);if(deep == 0)printf("%d",u);else printf("%d-->",u);}int main(){while(scanf("%d",&n),n){for(int i = 1; i <= n; i++)for(int j = 1; j <= n; j++){scanf("%d",&map[i][j]);if(map[i][j] == -1)map[i][j] = inf;}for(int i = 1; i <= n; i++)scanf("%d",&cost[i]);int s,e;while(scanf("%d%d",&s,&e)!=EOF){if(s == -1 && e == -1) break;for(int i = 1; i <= n; i++) Set[i].clear();Dijkstra(s);printf("From %d to %d :\nPath: ",s,e);dfs(e,0);printf("\nTotal cost : %d\n\n",dis[e] - cost[e]);}}return 0;}
AC:
#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;const int maxn = 105;const int inf = 0x3f3f3f3f;int n,map[maxn][maxn],path[maxn][maxn],cost[maxn];void init(){for(int i = 1; i <= n; i++)for(int j = 1; j <= n; j++)path[i][j] = j;}void floyd(){for(int k = 1; k <= n; k++)for(int i = 1; i <= n; i++)for(int j = 1; j <= n; j++){if(map[i][j] > map[i][k] + map[k][j] + cost[k]){map[i][j] = map[i][k] + map[k][j] + cost[k];path[i][j] = path[i][k];}else if(map[i][j] == map[i][k] + map[k][j] + cost[k])path[i][j] = min(path[i][j],path[i][k]);}}int main(){while(scanf("%d",&n),n){for(int i = 1; i <= n; i++)for(int j = 1; j <= n; j++){scanf("%d",&map[i][j]);if(map[i][j] == -1)map[i][j] = inf;}for(int i = 1; i <= n; i++)scanf("%d",&cost[i]);init();floyd();int s,e;while(scanf("%d%d",&s,&e)!=EOF){if(s == -1 && e == -1) break;printf("From %d to %d :\n",s,e); printf("Path: "); int u = s; printf("%d",u); while(u != e){ printf("-->%d",path[u][e]); u = path[u][e]; }printf("\nTotal cost : %d\n\n", map[s][e]); }}return 0;}
0 0
- hdu 1385(最短路+输出路径)
- hdu 1385 Minimum Transport Cost(最短路+输出路径)
- hdu 1385 Minimum Transport Cost 最短路加路径输出
- HDU 1385Minimum Transport Cost 最短路输出路径
- hdu 1385(zoj 1456)Minimum Transport Cost(最短路,输出路径,Floyd实现)
- 最短路(输出路径)
- hdoj 1385 输出 最短路的最小字典序路径
- [最短路径] HDU 2544 - 最短路
- ZOJ 1456 最短路 输出路径
- 各种最短路和路径输出
- Minimum Transport Cost hdu 1385(最短路 + 路径保存 + stack)
- hdu 1385 Minimum Transport Cost(最短路+记录路径)
- HDU 1385 Minimum Transport Cost【最短路之路径记录】
- hdu 1385 最短路+输出字典序--好题
- HDU 3991 最短路+最小路径覆盖
- HDU:最短路(单源最短路径Dijistra)
- Dijkstra-路径还原 输出最短路的路径
- hdu 1385 Minimum Transport Cost(输出最短路径)
- 判断线段相交的方法
- AirlineTicket
- 使用K近邻算法实现手写体识别系统
- Google谷歌在根据流量统计分析当年的2008年汶川大地震
- python添加django插件
- hdu 1385(最短路+输出路径)
- 错误记录--更改tomcat端口号方法,Several ports (8005, 8080, 8009)
- DOJ - 1002 Least Subsequence
- Node.js 学习笔记 —— console 控制台
- HDU组合游戏与博弈论入门小结(未完
- 线程的基本概念,状态,和状态之间的关系
- linux shell编程学习--test测试比较命令
- spring中lazy-init详解
- 101.[Leetcode]Symmetric Tree