hdu 1385 Minimum Transport Cost

 

Minimum Transport Cost

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)

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
  
  
  
  

   
    
  
  
  
  

   
   分析：
  
  
  
  

   
   这是一道比较好的最短路题目，很适合最短路径的入门，今天用Dijkstra模板套了一下，觉得还可以，主要就是在实现输出最小字典序的路径的时候遇到了一些困难。
  
  
  
  

   
    
  
  
  
  

   
   在实现路径的最小字典序的时候，我参考了别人的代码才写出来的。
  
  
  
  

   
    
  
  
  
  

   
   [code]
  
  
  
  

   
   
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<string> 
#include<iostream>
#include<algorithm>
using namespace std;
   
   
const int maxn=1005;
const int inf=1000005;
   
   
//path[]用于存储路径，s[]用于标记已访问过的节点 
int path[maxn],s[maxn],dist[maxn];
int edge[maxn][maxn];
int b[maxn];
int n;
   
   
//实现字符串翻转 
void Strrev(char a[])
{
   char b[maxn];
   int len=strlen(a);
   int j=0;len--;
   while(len>=0)
      b[j++]=a[len--];
   strcpy(a,b);
} 
   
   
//判断路径字典序的大小 
bool lessthan(int u,int x,int path[])
{
   char a[maxn],b[maxn];
   int len1=0,len2=0;
   a[len1++]=x+'0';
   a[len1++]=u+'0';
   b[len2++]=x+'0';
   while(path[u]!=-1)
   {
      a[len1++]=path[u]+'0';
      u=path[u];
   }
   a[len1]='\0';
   Strrev(a);
   while(path[x]!=-1)
   {
      b[len2++]=path[x]+'0';
      x=path[x];
   }
   b[len2]='\0';
   Strrev(b);
   if(strcmp(a,b)>0) return false;
   return true;
}
   
   
void Dijkstra(int v0)
{
   for(int i=0;i<n;i++)
   {
      dist[i]=edge[v0][i],s[i]=0;
      if(i!=v0&&dist[i]<inf) path[i]=v0;
      else path[i]=-1;
   }
   s[v0]=1,dist[v0]=0;
   
   for(int i=0;i<n-1;i++)
   {
      int min=inf,u=v0;
      for(int j=0;j<n;j++)
      {
         if(!s[j]&&dist[j]<min)
         {
            u=j;min=dist[j];
         }
      }
      s[u]=1;
      for(int j=0;j<n;j++)
      {
         if(!s[j]&&dist[j]>=dist[u]+edge[u][j]+b[u])
         {
            if(dist[j]>dist[u]+edge[u][j]+b[u])
            {
               dist[j]=dist[u]+edge[u][j]+b[u];
               path[j]=u;
            }
            else //如果路径权值相等，则进行判断字典序 
            {
               if(lessthan(u,j,path)==true)
                  path[j]=u;
            }
         }
      }
   }
}
   
   
int main()
{
   while(scanf("%d",&n),n)
   {
      int x;
      memset(edge,0,sizeof(edge));
      for(int i=0;i<n;i++)
         for(int j=0;j<n;j++)
         {  
            scanf("%d",&x);
            edge[i][j]=x;
            if(x==-1) edge[i][j]=inf;
         }  
      for(int i=0;i<n;i++)
         for(int j=0;j<n;j++)
            if(i==j) edge[i][j]=0;
            else if(edge[i][j]==0) edge[i][j]=inf;      
      for(int i=0;i<n;i++)
         scanf("%d",&b[i]);
      //Dijkstra(0);
      //cout<<dist[n-1]<<endl;
      int a,b;
      while(1)
      {
         scanf("%d%d",&a,&b);
         if(a==-1&&b==-1) break;
         if(a==b)
         {
            printf("From %d to %d :\nPath: %d\nTotal cost : %d\n\n",a,b,a,edge[a][b]);
            continue;
         }
         
         Dijkstra(a-1);
         int shortest[maxn];
         int i=b-1,j=0;
         shortest[j]=i;//保存路径 
         while(path[shortest[j]]!=a-1)
         {
            j++;
            shortest[j]=path[shortest[j-1]];
         }
         shortest[++j]=a-1;
         printf("From %d to %d :\nPath: ",a,b);
         for(;j>0;j--)
            printf("%d-->",shortest[j]+1);
         printf("%d\n",shortest[j]+1);
         printf("Total cost : %d\n\n",dist[i]);
      }
      
   }
   
   return 0;
}
[/code]