hdu 1385 Minimum Transport Cost
2017-08-29 20:05
225 查看
Minimum Transport Cost
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 11372 Accepted Submission(s): 3180
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 1217 1548 1690 2722
题意: 求两点间最短路并输出路径(如果有多条输出字典序小的)
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 11372 Accepted Submission(s): 3180
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 1217 1548 1690 2722
题意: 求两点间最短路并输出路径(如果有多条输出字典序小的)
#include <stdio.h> #include <string.h> #include <algorithm> #include <math.h> #define INF 999999999 #define maxn 500 int edge[maxn][maxn]; int path[maxn][maxn]; int tax[maxn]; int n; using namespace std; void floyd() { for(int i = 1; i <= n; i++) { for(int j = 1; j <= n; j++) { path[i][j] = j; } } int temp; for(int k = 1; k <= n; k++) { for(int i = 1; i <= n; i++) { for(int j = 1; j <= n; j++) { temp = edge[i][k] + edge[k][j] + tax[k]; if(edge[i][j] > temp) { edge[i][j] = temp; path[i][j] = path[i][k]; } else if(edge[i][j] == temp)//字典序 { if(path[i][j] > path[i][k]) 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++) { edge[i][j] = INF; } } int num; for(int i = 1; i <= n; i++) { for(int j = 1; j <= n; j++) { scanf("%d",&num); if(num != -1) edge[i][j] = num; } } for(int i = 1; i <= n; i++) { scanf("%d",&tax[i]); } floyd(); int s,d; while(~scanf("%d%d",&s,&d)) { if(s == -1 && d == -1) break; int temp = s; printf("From %d to %d :\nPath: %d",s,d,s); while(temp != d) { printf("-->"); printf("%d",path[temp][d]); temp = path[temp][d]; } printf("\nTotal cost : %d\n\n",edge[s][d]); } } }
相关文章推荐
- HDU-1385 Minimum Transport Cost
- HDU 1385 Minimum Transport Cost 【最短路 + 最小字典序路径输出】
- hdu 1385 floyd的妙用 Minimum Transport Cost
- hdu 1385 Minimum Transport Cost(最短路+输出路径)
- hdu 1385 Minimum Transport Cost Floyd
- hdu 1385 Minimum Transport Cost
- HDU1385 Minimum Transport Cost
- hdu 1385 Minimum Transport Cost
- 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(Floyd打印路径)
- hdu 1385 Minimum Transport Cost(floyd && 记录路径)
- HDU 1385 Minimum Transport Cost
- HDU_1385 Minimum Transport Cost( Dijkstra )
- Minimum Transport Cost hdu 1385(最短路 + 路径保存 + stack)
- HDU 1385 Minimum Transport Cost (字典序打印最短路)
- hdu 1385 最短路+字典序比较 Minimum Transport Cost
- HDU 1385 Minimum Transport Cost(Floyd 最短路 打印路径)