hdu1385 Minimum Transport Cost (floyd输出字典序最小的路径)
2016-02-08 21:52
567 查看
Minimum Transport Cost
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9313 Accepted Submission(s): 2480
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.
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:
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.
Sample Input
5
0 3 22 -1 4
3 0 5 -1 -1
22 5 0 9 20
-1 -1 9 0 4
4 -1 20 4 0
5 17 8 3 1
1 3
3 5
2 4
-1 -1
0
Sample Output
From 1 to 3 :
Path: 1-->5-->4-->3
Total cost : 21
From 3 to 5 :
Path: 3-->4-->5
Total cost : 16
From 2 to 4 :
Path: 2-->1-->5-->4
Total cost : 17
Source
Asia 1996, Shanghai (Mainland China)
Recommend
Eddy | We have carefully selected several similar problems for you: 1142 1548 2544 2066 1874
解析:path[i][j]记录从 i 到 j 的最短路的第一个点。
代码:
#include<cstdio>
using namespace std;
const int inf=0x7fffffff;
const int maxn=2e2;
int a[maxn][maxn],b[maxn];
int path[maxn][maxn];
int main()
{
//freopen("1.in","r",stdin);
int n,i,j,k,s,e;
while(scanf("%d",&n),n)
{
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
scanf("%d",&a[i][j]);
if(a[i][j]<0)a[i][j]=inf;
path[i][j]=j;
}
for(i=1;i<=n;i++)scanf("%d",&b[i]),a[i][i]=0;
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)if(a[i][k]<inf && i!=k)
for(j=1;j<=n;j++)if(a[k][j]<inf && j!=k && j!=i)
{
s=a[i][k]+a[k][j]+b[k];
if(a[i][j]<s)continue;
if(a[i][j]>s){a[i][j]=s;goto d1;}
if(path[i][j]>path[i][k])d1:path[i][j]=path[i][k];
}
while(scanf("%d%d",&s,&e),s>0)
{
printf("From %d to %d :\n",s,e);
printf("Path: %d",k=s);
while(k!=e)printf("-->%d",k=path[k][e]);
printf("\nTotal cost : %d\n\n",a[s][e]);
}
}
return 0;
}
相关文章推荐
- 尝试做第一个网站
- Unity3D之Vector3.Dot和Vector3.Cross的使用
- 敏捷测试(二)敏捷测试的方法与实践
- 一些实用的mysql语句(不断积累更新)
- 生活随笔:病人(3)
- 动画之补间透明度动画
- Java 基础总结--final关键字
- Python 单元测试
- ASM - 条件判断
- poj 3264 Balanced Lineup(RMQ && 线段树)
- Runtime_实例变量遍历
- Android TV -1.1- Get Started with TV Apps
- JAVA菜鸟之路1
- psycopg2接口的基本用法
- Android TV -1- Building TV Apps
- 例题6-8 UVa548 Tree(树的遍历转换)
- 《笨办法学Python》 第36课手记
- 装饰器与函数多层嵌套
- Java 数据存储地方
- 学习笔记一