HDU 1385 Minimum Transport Cost

Minimum Transport Cost

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 6182    Accepted Submission(s): 1561

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 1874 1690 2112 

 

思路：floyd

 

代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
const int MAXN = 100000000;
int n;
int cast[1010];
int map[1010][1010];
int begin,end;
int sum;
int pre[1010][1010];
void Floyd(int n,int map[1010][1010],int pre[1010][1010])
{
    for(int k = 1;k <= n;k ++)
    {
        for(int i = 1;i <= n;i ++)
        {
            for(int j = 1;j <= n;j ++)
            {
                if(map[i][j] > map[i][k] + map[k][j] + cast[k])
                {
                    map[i][j] = map[i][k] + map[k][j] + cast[k];
                    pre[i][j] = pre[i][k];
                }
                else if(map[i][j] == map[i][k] + map[k][j] + cast[k]
                        && pre[i][j] > pre[i][k])
                {
                           pre[i][j] = pre[i][k];
                }
            }
        }
    }
}
int main()
{
    while(~scanf("%d",&n),n != 0)
    {
        for(int i = 1;i <= n;i ++)
        {
            for(int j = 1;j <= n;j ++)
            {
                scanf("%d",&map[i][j]);
                pre[i][j] = j;
                if(map[i][j] == -1)
                   map[i][j] = MAXN;
            }
        }
        for(int i = 1;i <= n;i ++)
            scanf("%d",&cast[i]);
        Floyd(n,map,pre);
        while(~scanf("%d%d",&begin,&end))
        {
            if(begin == -1 && end == -1)
            {
                break ;
            }
            sum = 0;
            printf("From %d to %d :
",begin,end);
            int path[1010];
            int pa = 1;
            path[1] = end;
            int a = begin;
            int b = end;
            while(1)
            {
                if(begin == end)
                    break ;
                path[++ pa] = pre[begin][end];
                begin = pre[begin][end];
            }
            printf("Path: ");
            printf("%d",a);
            for(int j = 2;j <= pa;j ++)
            {
                printf("-->%d",path[j]);
            }
            printf("
");
            printf("Total cost : %d
",map[a][b]);
            printf("
");
        }
    }
    return 0;
}