HDOJ 题目 1385 Minimum Transport Cost(最短路输出路径)
来源:互联网 发布:会计试题软件 编辑:程序博客网 时间:2024/06/08 06:45
Minimum Transport Cost
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7768 Accepted Submission(s): 2001
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
Source
Asia 1996, Shanghai (Mainland China)
Recommend
Eddy | We have carefully selected several similar problems for you: 1142 2722 2680 2962 2433
ac代码
#include<stdio.h>#include<string.h>#define INF 0xfffffffint map[1010][1010],path[1010][1010],b[1010];int main(){ int n; while(scanf("%d",&n)!=EOF,n) { int i,j,k,c,s,ss,tt; for(i=1;i<=n;i++) for(j=1;j<=n;j++) { scanf("%d",&c); if(c!=-1) map[i][j]=c; else map[i][j]=INF; path[i][j]=j; } for(i=1;i<=n;i++) scanf("%d",&b[i]); for(k=1;k<=n;k++) { for(i=1;i<=n;i++) { for(j=1;j<=n;j++) { s=map[i][k]+map[k][j]+b[k]; if(s<map[i][j]) { map[i][j]=s; path[i][j]=path[i][k]; } if(s==map[i][j]) { if(path[i][j]>path[i][k]) path[i][j]=path[i][k]; } } } } while(scanf("%d%d",&ss,&tt)!=EOF) { int k=ss; if(ss==-1||tt==-1) break; printf("From %d to %d :\n",ss,tt); printf("Path: %d",ss); while(k!=tt) { printf("-->%d",path[k][tt]); k=path[k][tt]; } printf("\n"); // printf("-->%d\n",tt); printf("Total cost : %d\n\n",map[ss][tt]); } }}
0 0
- HDOJ 题目1385 Minimum Transport Cost(最短路,输出路径)
- HDOJ 题目 1385 Minimum Transport Cost(最短路输出路径)
- HDOJ--1385--Minimum Transport Cost(最短路记录路径)
- hdu 1385 Minimum Transport Cost(最短路+输出路径)
- HDOJ 1385 Minimum Transport Cost (最短路 Floyd & 路径记录)
- hdu 1385 Minimum Transport Cost 最短路加路径输出
- HDU 1385Minimum Transport Cost 最短路输出路径
- hdu 1385 Minimum Transport Cost(最短路+记录路径)
- hdu 1385(zoj 1456)Minimum Transport Cost(最短路,输出路径,Floyd实现)
- hdoj Minimum Transport Cost 1385 (floyd++路径输出)
- hdoj 1385 Minimum Transport Cost【最短路-->floyd】
- Minimum Transport Cost hdu 1385(最短路 + 路径保存 + stack)
- HDU 1385 Minimum Transport Cost【最短路之路径记录】
- hdu 1385 Minimum Transport Cost(输出最短路径)
- hdu 题目1385 Minimum Transport Cost (最短路径,路径保存及筛选)
- HDU 1385 Minimum Transport Cost(Floyd 最短路 打印路径)
- HDU 1385 Minimum Transport Cost (最短路+记录路径+字典序)
- hdu 1385 Minimum Transport Cost(最短路 + 字典序最小路径)
- Android 项目中文件夹的作用
- 轻量级HTTP服务器Nginx(配置与调试Nginx)
- Android 第三方登录
- 【POJ】3294 Life Forms 【后缀数组——求在超过一半串中出现的最长串】
- Texas Instrument's Bluetooth Driver For Shared Transport 笔记
- HDOJ 题目 1385 Minimum Transport Cost(最短路输出路径)
- JavaScript中的线程和CPU的调度
- Node.js npm编译打包自定义的zepto模块
- SQL
- 移动应用开发系列-2-mysql
- 区县政府网站建设要点总结
- appfuse - hibernate search 2 - 常用注解
- Win8快捷键
- 工业水处理:威立雅化工污水处理工艺流程与技术特点