zoukankan      html  css  js  c++  java
  • hdu 1385 Minimum Transport Cost(floyd && 记录路径)

    Minimum Transport Cost

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


    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) 

    #include<stdio.h>
    #include<string.h>
    #define M 500
    #define inf 0x3f3f3f3f
    int dis[M][M],b[M],n,re[M][M];//re记录一条边的后驱 
    void floyd(){
    	for(int k=1;k<=n;k++)
    		for(int i=1;i<=n;i++)
    			for(int j=1;j<=n;j++){
    				if(dis[i][j] > dis[i][k]+dis[k][j]+b[k]){//注意加上这个城市的值	
    					dis[i][j] = dis[i][k]+dis[k][j]+b[k];
    					re[i][j] = re[i][k];
    				}else{
    					if(dis[i][j] == dis[i][k]+dis[k][j]+b[k] && re[i][j]>re[i][k])//当路径相等的时候按字典序选择)
    							re[i][j] = re[i][k];
    				}
    			}
    }
    int main(){
    	int i,j,x,y;
    	while(~scanf("%d",&n),n){
    		memset(re,0,sizeof(re));
    		for(i=1;i<=n;i++)
    			for(j=1;j<=n;j++){
    				scanf("%d",&dis[i][j]);
    				if(dis[i][j]==-1)
    					dis[i][j]=inf;
    				re[i][j]=j;
    			}
    		for(i=1;i<=n;i++)
    			scanf("%d",&b[i]);
    		floyd();
    		while(scanf("%d%d",&x,&y),(x!=-1||y!=-1)){
    			printf("From %d to %d :
    Path: %d",x,y,x);
    			int u=x,v=y;
    			while(u!=v){
    				printf("-->%d",re[u][v]);
    				u=re[u][v];
    			}
    			printf("
    Total cost : %d
    
    ", dis[x][y]);
    		}
    	}
    	return 0;
    } 


  • 相关阅读:
    rest framework 认证 权限 频率
    rest framework 视图,路由
    rest framework 序列化
    10.3 Vue 路由系统
    10.4 Vue 父子传值
    10.2 Vue 环境安装
    10.1 ES6 的新增特性以及简单语法
    Django 跨域请求处理
    20190827 On Java8 第十四章 流式编程
    20190825 On Java8 第十三章 函数式编程
  • 原文地址:https://www.cnblogs.com/zhchoutai/p/8578385.html
Copyright © 2011-2022 走看看