HDU 1385:Minimum Transport Cost【Floyd】
来源:互联网 发布:php strcasecmp 编辑:程序博客网 时间:2024/06/08 08:33
Minimum Transport Cost
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8793 Accepted Submission(s): 2310
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
注意~如果费用相等的话,按字典序输出~~
AC-code:
#include<cstdio>#include<cstring>#define INF 0x3f3f3f3fint path[200][200],p2[200],p[200][200],n;void floyd(){int k,i,j;for(k=1;k<=n;k++)for(i=1;i<=n;i++)for(j=1;j<=n;j++){if(p[i][j]>p[i][k]+p[k][j]+p2[k]){p[i][j]=p[i][k]+p[k][j]+p2[k];path[i][j]=path[i][k];}else if(p[i][j]==p[i][k]+p[k][j]+p2[k])//在此注意~~~{if(path[i][j]>path[i][k]){p[i][j]=p[i][k]+p[k][j]+p2[k];path[i][j]=path[i][k];}}}}void print(int a,int b){int k;if(a==b){printf("%d\n",b);return ;}k=path[a][b];printf("%d-->",a);print(k,b);}int main(){int i,j,k,a,b;while(scanf("%d",&n),n){for(i=1;i<=n;i++)for(j=1;j<=n;j++){scanf("%d",&p[i][j]);if(p[i][j]==-1)p[i][j]=INF;path[i][j]=j;}for(i=1;i<=n;i++)scanf("%d",&p2[i]);floyd();while(scanf("%d%d",&a,&b)){if(a==-1&&b==-1)break;printf("From %d to %d :\n",a,b);printf("Path: ");print(a,b);printf("Total cost : %d\n\n",p[a][b]);}}return 0;}
0 0
- HDU-1385-Minimum Transport Cost(floyd)
- hdu 1385 Minimum Transport Cost Floyd
- HDU 1385:Minimum Transport Cost【Floyd】
- HDU 1385 Minimum Transport Cost(Floyd)
- hdu 1385 Minimum Transport Cost--Floyd算法+点权值+记录路径
- HDU 1385 Minimum Transport Cost(Floyd + 打印路径)
- hdu 1385 Minimum Transport Cost (floyd算法)
- HDU 1385 Minimum Transport Cost (Floyd算法 + 路径输出)
- HDU 1385Minimum Transport Cost(floyd+记录路径)
- hdu 1385 floyd的妙用 Minimum Transport Cost
- HDU 1385(Minimum Transport Cost)floyd+正向返回路径
- hdu 1385 Minimum Transport Cost (Floyd 路径输出)
- hdu 1385 Minimum Transport Cost(floyd && 记录路径)
- hdu 1385 Minimum Transport Cost(Floyd打印路径)
- hdu 1385 Minimum Transport Cost【floyd过】【最短路】
- hdu 1385 Minimum Transport Cost (Floyd 记录路径)
- HDU 1385 Minimum Transport Cost(Floyd+路径输出)
- HDU 1385-Minimum Transport Cost(floyd&&最小字典序)
- 回文串问题(2013中南大学研究生复试题)
- Fragment强烈不推荐使用自定义带参的构造函数
- 设置自定义UITableViewCell之间的间距
- 啊哈磊的算法
- java嵌套类(Nested Classes)总结
- HDU 1385:Minimum Transport Cost【Floyd】
- php中数据库pdo的exec方法返回影响行数的问题
- nginx + tomcat 负载均衡+session复制共享
- POJ 2785 折半枚举
- 编译fdk-aac,执行批处理的时候出现这个错误,mingw32-gcc.exe: error: CreateProcess: No such file or directory的问题
- Weiler-Atherton多边形裁剪算法
- java设计模式—建造者模式
- requirejs 同过hack改变文件映射
- __try __try __finally __except 嵌套