关闭

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

标签: 算法HDUZOJ最短路Floyd
223人阅读 评论(0) 收藏 举报
分类:

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;
}
0
0
查看评论
发表评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场

最短路之 路径记录 dijkstra + floyd + SPFA 【小笔记】

引子:我们在求解最短路的时候,有的时候需要输出路径,这里就介绍下路径记录及输出的一些方法。 为了更好理解,提出一个问题: 给出n个车站,m条单向路线以及 每条路线的信息即 起点终点和对应的花费(n...
  • chenzhenyu123456
  • chenzhenyu123456
  • 2015-06-28 11:56
  • 1692

Floyd算法求最短路径并记录路径

基本模型从最开始只允许经过1号顶点中转,接下来允许经过1号和2号中转……..允许经过1~n号所有的顶点进行中转,求任意两点间的最短路程。用一句话概括就是:从i号顶点到j号顶点之经过前k号的最短路程。实...
  • nghuyong
  • nghuyong
  • 2016-12-19 13:11
  • 2709

floyd算法求解最短路径

转自  http://blog.csdn.net/zhongkeli/article/details/8832946 这个算法主要要弄懂三个循环的顺序关系。 弗洛伊德(...
  • Bocai_Fire
  • Bocai_Fire
  • 2015-05-05 07:54
  • 8400

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

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

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
  • 752

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

题目地址:http://acm.hdu.edu.cn/showproblem.php?pid=1385 这题第一次是用s
  • u013013910
  • u013013910
  • 2014-05-14 15:55
  • 611

ZOJ1456 HDU1385 Minimum Transport Cost,Dijkstra算法

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

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

Minimum Transport Cost Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Jav...
  • u012846486
  • u012846486
  • 2014-08-12 20:48
  • 459

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

/* Floyd算法+点权值+记录路径 */ #include int map[110][110],tax[110],path[110][110]; int n; #define ima...
  • qq172108805
  • qq172108805
  • 2011-08-12 10:19
  • 607

hdu1385 Minimum Transport Cost (floyd输出字典序最小的路径)

Minimum Transport Cost Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Jav...
  • yuyanggo
  • yuyanggo
  • 2016-02-08 21:52
  • 327
    个人资料
    • 访问:51727次
    • 积分:2240
    • 等级:
    • 排名:第19360名
    • 原创:176篇
    • 转载:2篇
    • 译文:0篇
    • 评论:32条
    文章分类
    最新评论