HDU 1365 & ZOJ 1456 Minimum Transport Cost(记录路径Floyd)

原创 2016年08月28日 17:12:04

Minimum Transport Cost

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


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
 

Recommend
Eddy   |   We have carefully selected several similar problems for you:  1142 1217 1690 2112 2722 
 

题目大意:
    有N个城市,有的城市之间有道路,每进过一个道路就要花费一定的钱,每经一个城市也需要花费一定的钱(起点终点不用),求从一点到一点的最小花费以及路径。

解题思路:
    由于是一张图多组查询很自然就想到使用Floyd算法,不过要记录路径似乎就不好写了,上网查了一下,原来Floyd算法真的可以记录路径,具体方法是设置一个path[i][j]数组表示从i到j进过的第一个点,然后在松弛的时候不断更新,这样就可以记录下路径(具体写法见代码)。

AC代码:
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
#define INF 0x3f3f3f3f

const int maxn=100+3;
int N,G[maxn][maxn],path[maxn][maxn],tax[maxn];

void Floyd()
{
    for(int k=0;k<N;++k)
        for(int i=0;i<N;++i)
            for(int j=0;j<N;++j)
                if(G[i][k]+G[k][j]+tax[k]<G[i][j])//如果能够松弛则松弛
                {
                    G[i][j]=G[i][k]+G[k][j]+tax[k];
                    path[i][j]=path[i][k];
                }
                else if(G[i][k]+G[k][j]+tax[k]==G[i][j]&&path[i][k]<path[i][j])//如果距离相等但字典序更小也松弛
                    path[i][j]=path[i][k];//path[i][j]表示i到j进过的第一个点
}

int main()
{
    while(~scanf("%d",&N)&&N)
    {
        for(int i=0;i<N;++i)
            for(int j=0;j<N;++j)
            {
                scanf("%d",&G[i][j]);
                if(G[i][j]==-1)
                    G[i][j]=INF;
                path[i][j]=j;
            }
        for(int i=0;i<N;++i)
            scanf("%d",&tax[i]);
        Floyd();
        int s,t;
        while(~scanf("%d%d",&s,&t)&&!(s==-1&&t==-1))
        {
            printf("From %d to %d :\nPath: %d",s,t,s);
            int tmp=s-1;
            while(tmp!=t-1)
            {
                printf("-->%d",path[tmp][t-1]+1);
                tmp=path[tmp][t-1];
            }
            printf("\nTotal cost : %d\n\n",G[s-1][t-1]);
        }
    }
    
    return 0;
}
版权声明:转载请注明出处:http://blog.csdn.net/yasola,谢谢

相关文章推荐

hdu 1385(zoj 1456)Minimum Transport Cost(最短路,输出路径,Floyd实现)

图论的最短路问题,这道题多了个每个点的权值(就是tax值,相当于过路费),还有要求输出最短路径,如果路长相等,以字典序为准。我用的是Floyd(因为……dijkstra我还不会路径回溯……)。另设一个...

ZOJ1456 Minimum Transport Cost 用floyd记录路径

These are N cities in Spring country. Between each pair of cities there may be one transportation tr...
  • AXuan_K
  • AXuan_K
  • 2014年10月20日 11:27
  • 720

HDU 1385Minimum Transport Cost(floyd+记录路径)

题目地址:http://acm.hdu.edu.cn/showproblem.php?pid=1385 这题第一次是用s

HDU1385 Minimum Transport Cost 【Floyd】+【路径记录】

Minimum Transport Cost Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Jav...

hdu 1385 Minimum Transport Cost--Floyd算法+点权值+记录路径

/* Floyd算法+点权值+记录路径 */ #include int map[110][110],tax[110],path[110][110]; int n; #define ima...

ZOJ1456 HDU1385 Minimum Transport Cost,Dijkstra算法

这题WA了很多次。这题除了是应用Dijkstra算法外,还有个要点是输出路径词典序,所以要记录路径。我在这里为了节省空间,只记录到达本节点的上一个前驱,如果遇到到达本节点的费用一样的另一个前驱,就可以...
  • neofung
  • neofung
  • 2011年08月14日 16:51
  • 885

hdu 1385 Minimum Transport Cost(最短路,floyd打印字典序路径)

题目链接: http://acm.hdu.edu.cn/showproblem.php?pid=1385 解题思路: 题目大意: 有N个城市,然后直接给出这些城市之间的邻接矩阵,矩阵中-1...

HDU 1385 Minimum Transport Cost(Floyd+打印字典序最小路径)

HDU 1385 Minimum Transport Cost(Floyd+打印字典序最小路径) http://acm.hdu.edu.cn/showproblem.php?pid=1385 题意:给...

HDU 1385 Minimum Transport Cost(Floyd + 打印路径)

题目:http://acm.hdu.edu.cn/showproblem.php?pid=1385 题意:先给你一张你n * n的图,代表城市间的距离,然后,给出n个tax的费用,然后很多询问,问...

hdu1385Minimum Transport Cost-floyd+打印路径

hdu1385 肚子好饿! #include #include #include #define M 500 #define INF 1000000000 using ...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:HDU 1365 & ZOJ 1456 Minimum Transport Cost(记录路径Floyd)
举报原因:
原因补充:

(最多只允许输入30个字)