HDU 1385 Minimum Transport Cost
来源:互联网 发布:书生软件安卓 编辑:程序博客网 时间:2024/04/29 00:30
Minimum Transport Cost
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 10215 Accepted Submission(s): 2802
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-->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 0X3f3f3f3fusing namespace std;int mapp[N][N];int tax[N];int path[N][N];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[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
阅读全文
1 0
- 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
- 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
- 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
- hdu 1385 Minimum Transport Cost
- HDU 1385 Minimum Transport Cost
- hdu Minimum Transport Cost(1385)
- 51NOD 1264 两线段相交模板
- 51NOD 1212 最小生成树模板
- 多线程-买电影票出现了同票和负数票的原因分析
- 51NOD 1242 斐波那契数列的第N项
- 51NOD 最长递增子序列(模板)
- HDU 1385 Minimum Transport Cost
- HDU 2586 How far away?(lca模板)
- HDU 3486 Interviewe(RMQ问题)
- HDU 2121 Ice_cream’s world II
- Future结合RxJava 实现异步调用
- HDU 3339 In Action(最短路+01背包)
- HDU 2722 Here We Go(relians) Again
- HDU 1839 Delay Constrained Maximum Capacity Path(最短路+二分搜索)
- HDU 4179 Difficult Routes