zoukankan      html  css  js  c++  java
  • ACM HDU 1385Minimum Transport Cost

    Minimum Transport Cost

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


    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
     
     
    用Floyed算法,主要问题是记录路径,看了大牛做的才明白怎么样记录的。
    用map[a][b]记录从a到b最短路径的第一个经过的点!
    同时注意字典序排列
    代码:
    #include<stdio.h>
    #include
    <string.h>
    const int maxint=65533;
    #define MAXN 100
    int N;
    int distances[MAXN][MAXN];
    int map[MAXN][MAXN];//map[a][b]表示a到b的所有路径中的与a最近的一个

    int tax[MAXN];
    void Floyed()
    {

    int i,j,k;
    for(i=1;i<=N;i++)
    for(j=1;j<=N;j++)
    map[i][j]
    =j;
    for( i=1;i<=N;i++)
    {
    for( j=1;j<=N;j++)
    for( k=1;k<=N;k++)
    {
    int t_dis=distances[j][i]+distances[i][k]+tax[i];

    if(distances[j][k]>t_dis)
    {
    distances[j][k]
    =t_dis;
    map[j][k]
    =map[j][i];

    }
    if(distances[j][k]==t_dis)//字典序
    if(map[j][k]>map[j][i])map[j][k]=map[j][i];
    }
    }
    }
    int main()
    {
    //freopen("test.in","r",stdin);
    //freopen("test.out","w",stdout);
    int i,j,A;
    while(scanf("%d",&N),N)
    {
    for(i=1;i<=N;i++)
    for(j=1;j<=N;j++)
    {
    scanf(
    "%d",&A);
    if(A==-1)distances[i][j]=maxint;
    else distances[i][j]=A;
    }
    for(i=1;i<=N;i++)scanf("%d",&tax[i]);
    Floyed();
    int a,b;
    while(scanf("%d%d",&a,&b)!=EOF)
    {
    if(a==-1&&b==-1)break;
    printf(
    "From %d to %d :\n",a,b);
    printf(
    "Path: %d",a);
    int t=a;
    while(t!=b)
    {
    printf(
    "-->%d",map[t][b]);
    t
    =map[t][b];
    }
    //printf("-->%d\n",b);
    printf("\n");
    printf(
    "Total cost : %d\n\n",distances[a][b]);

    }
    }
    return 0;
    }

     
  • 相关阅读:
    破圈法求最小生成树+最小生成树与最短路径问题
    相信你们的锐意前行,终将成就更美好的未来
    “基于模块化自动驾驶底盘的PIX移动空间”发布
    Node:通过 Uglify 压缩小程序代码
    CSS 实用技巧
    websercie调用方式
    IDEA 添加tomcat启动后控制台乱码解决方案
    对象转json串,json转对象
    js 判断一个变量是数组还是对象
    @Transactional 锁表吗?关于Spring注解@Transactional和SQL for update 的一些观点
  • 原文地址:https://www.cnblogs.com/kuangbin/p/2116662.html
Copyright © 2011-2022 走看看