HDU 1385 Minimum Transport Cost
2017-06-03 09:04
288 查看
Minimum Transport Cost
[b]Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 10215 Accepted Submission(s): 2802
[/b]
[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
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:
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
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
[align=left]Sample Output[/align]
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
2016-12-10 22:17:56
[b]Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 10215 Accepted Submission(s): 2802
[/b]
[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
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:
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
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
[align=left]Sample Output[/align]
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
#include <iostream> #include <cstring> #define N 500 #define inf 0X3f3f3f3f using namespace std; int mapp ; int tax ; int path ; int main() { int n; cin.sync_with_stdio(false); while (cin >> n&&n) { for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { cin >> mapp[i][j]; if (mapp[i][j] == -1) { mapp[i][j] = inf; } path[i][j] = j; } } for (int i = 1; i <= n; i++) { cin >> tax[i]; } for (int k = 1; k <= n; k++) { for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { if (mapp[i][j]>mapp[i][k] + mapp[k][j] + tax[k]) { mapp[i][j] = mapp[i][k] + mapp[k][j] + tax[ c00c k]; path[i][j] = path[i][k];//记录前驱节点 } else if (mapp[i][j] == mapp[i][k] + mapp[k][j] + tax[k] && path[i][j]>path[i][k]) { path[i][j] = path[i][k];//相等按字典序排,更新前驱节点 } } } } int a, b, c, d; while (cin >> a >> b && (a != -1) && (b != -1)) { cout << "From " << a << " to " << b << " :" << endl; cout << "Path: " << a; c = a; d = b; while (c != d) { cout << "-->" << path[c][d]; c = path[c][d]; } cout << endl << "Total cost : " << mapp[a][b] << endl << endl; } } return 0; }
2016-12-10 22:17:56
相关文章推荐
- hdu 1385 Minimum Transport Cost【floyd】
- HDU 1385 Minimum Transport Cost(最短路Floyd+标记路径)
- hdu 1385 Minimum Transport Cost
- HDU 1385 Minimum Transport Cost
- hdu-1385 Minimum Transport Cost
- hdu 1385 Minimum Transport Cost 最短路加路径输出
- hdu 1385(zoj 1456)Minimum Transport Cost(最短路,输出路径,Floyd实现)
- HDU 1385 Minimum Transport Cost【最短路之路径记录】
- hdu 1385 Minimum Transport Cost
- 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
- HDU 1385-Minimum Transport Cost(floyd&&最小字典序)
- HDU 1385 Minimum Transport Cost (floyd算法,求最短路径)
- hdu 1385 Minimum Transport Cost
- hdu 1385 Minimum Transport Cost(输出最短路径)
- Hdu-1385 Minimum Transport Cost
- HDU 1385 Minimum Transport Cost