1018 Public Bike Management (30)（30 分）

There is a public bike service in Hangzhou City which provides great convenience to the tourists from all over the world. One may rent a bike at any station and return it to any other stations in the city.

The Public Bike Management Center (PBMC) keeps monitoring the real-time capacity of all the stations. A station is said to be in perfect condition if it is exactly half-full. If a station is full or empty, PBMC will collect or send bikes to adjust the condition of that station to perfect. And more, all the stations on the way will be adjusted as well.

When a problem station is reported, PBMC will always choose the shortest path to reach that station. If there are more than one shortest path, the one that requires the least number of bikes sent from PBMC will be chosen.

\ Figure 1

Figure 1 illustrates an example. The stations are represented by vertices and the roads correspond to the edges. The number on an edge is the time taken to reach one end station from another. The number written inside a vertex S is the current number of bikes stored at S. Given that the maximum capacity of each station is 10. To solve the problem at S~3~, we have 2 different shortest paths:

1. PBMC -> S~1~ -> S~3~. In this case, 4 bikes must be sent from PBMC, because we can collect 1 bike from S~1~ and then take 5 bikes to S~3~, so that both stations will be in perfect conditions.

2. PBMC -> S~2~ -> S~3~. This path requires the same time as path 1, but only 3 bikes sent from PBMC and hence is the one that will be chosen.

Input Specification:

Each input file contains one test case. For each case, the first line contains 4 numbers: C~max~ (<= 100), always an even number, is the maximum capacity of each station; N (<= 500), the total number of stations; S~p~, the index of the problem station (the stations are numbered from 1 to N, and PBMC is represented by the vertex 0); and M, the number of roads. The second line contains N non-negative numbers C~i~ (i=1,...N) where each C~i~ is the current number of bikes at S~i~ respectively. Then M lines follow, each contains 3 numbers: S~i~, S~j~, and T~ij~ which describe the time T~ij~ taken to move betwen stations S~i~ and S~j~. All the numbers in a line are separated by a space.

Output Specification:

For each test case, print your results in one line. First output the number of bikes that PBMC must send. Then after one space, output the path in the format: 0-&gtS~1~->...-&gtS~p~. Finally after another space, output the number of bikes that we must take back to PBMC after the condition of S~p~ is adjusted to perfect.

Note that if such a path is not unique, output the one that requires minimum number of bikes that we must take back to PBMC. The judge's data guarantee that such a path is unique.

 

---

//Tips:1.注意，每一站多的车辆只能放到后面一站去，而不能补充前面车站中少的数目。
//这是一个陷阱，我一开始没有注意到，结果2个case一直过不去。
//如果前面车站有多的，那么优先将多出来的补充这一站缺少的。
//2.最后就是优先级问题，第一是路径最短，第二是带出来的车数最少，第三是带回去的车数最少
//3.循环当前层信息不可更新，否则对该节点的另一条路有影响 （见83行及123行）
#include <stdio.h>
#include <limits.h>
#define MAXSIZE 501

int Graph[MAXSIZE][MAXSIZE];

bool visited[MAXSIZE]={false};

void dfs(int N,int &minTime,int &sentmin,int &backmin,int Sp,int Time,int level,int C[],int minway[],int way[],int the,int max,int sent,int back){

int i;
 
 if(the==Sp)
 {
 // printf("到达路线为：\n");
  
 // for(i=0;i<=level;i++) printf("%d->",way[i]);
  
 // printf("\n");  
  if(Time<minTime)
  {
   minTime=Time;
   
   for(i=0;i<MAXSIZE;i++) minway[i]=-1;
   
   for(i=0;i<=level;i++) minway[i]=way[i];//刷新路线
   
   sentmin=sent;
   
   backmin=back;
  
  }
  
  else if(minTime==Time){
    if(sent<sentmin)
    {
     for(i=0;i<MAXSIZE;i++) minway[i]=-1;
   
     for(i=0;i<=level;i++) minway[i]=way[i];
    
     backmin=back;
    
     sentmin=sent;
    
    }
    else if(sent==sentmin){
    
     if(back<backmin)
     {
     for(i=1;i<MAXSIZE;i++) minway[i]=-1;
   
     for(i=1;i<=level;i++) minway[i]=way[i];
    
     backmin=back;
    
     sentmin=sent;
     
     }
    
    
    }
    
   }
    
    return;
 }
 
 else if(Time>minTime) return;
 
 else
 {
  visited[the]=true;
  
  for(i=1;i<=N;i++)
  {
  if(!visited[i]&&Graph[the][i]!=-1)
   {
    int sent1=sent,back1=back,t=Time,l=level;
    
    Time+=Graph[the][i],level++;//记录该路上有多少车，以及站点数，站点数*max/2-路上的车数就可以知道了
    
    way[level]=i;
   //printf("目前层数%d,back:%d sent:%d \n",level,back,sent); 
   //这里要注意back和sent不能发生改变
    
   
   if(C[i]>max/2)//有多的只能拿
   {
    back+=C[i]-max/2;
   }
   
   else {
   //少了可以从back中取
    int need=max/2-C[i];
    
    if(back>=need) {
    back-=need;
    need=0;
    }
    
    else if(back>0)
    {
     need-=back;
     back=0;
     
     //printf("need:%d\n",need);
    }
    
    sent+=need;
   
   }
   
    
   // printf("%d到%d号站点，目前层数%d,back:%d sent:%d 需求:%d\n",the,i,level,back,sent,max/2-C[i]);
   
    dfs(N,minTime,sentmin,backmin,Sp,Time,level,C,minway,way,i,max,sent,back);
    
    back=back1;sent=sent1;Time=t;level=l;
   }
  
  }
 
  visited[the]=false;
 
 }

}

int main(){

 int max,N,Sp,M,C[501],i,j;
 
 scanf("%d %d %d %d",&max,&N,&Sp,&M);
  
 for(i=1;i<=N;i++)
 
 scanf("%d",&C[i]);
 
 for(i=0;i<=N;i++)
 {
  for(j=0;j<=N;j++)
  {
   if(i==j)
   Graph[i][j]=0;
   else
   Graph[i][j]=-1;
  }
 
 }
 
 for(i=0;i<M;i++)
 {
  int s1,s2,t;
  
  scanf("%d %d %d",&s1,&s2,&t);
  
  Graph[s1][s2]=t;
  
  Graph[s2][s1]=t;
 
 }
 
 int minTime=INT_MAX,sentmin=INT_MAX,backmin=INT_MAX,minway[MAXSIZE],way[MAXSIZE];
 
 minway[0]=0;
 
 way[0]=0;
 
 for(i=1;i<MAXSIZE;i++) {
 
 minway[i]=-1;
 
 way[i]=-1;
 
 }
 
 visited[0]=true;
 //深度优先搜索
 for(i=1;i<=N;i++)
 {
  if(!visited[i]&&Graph[0][i]!=-1)
  {
   
   int Time=Graph[0][i],level=1,sent=0,back=0;
    
   way[level]=i;
   
   if(C[i]>max/2) back=C[i]-max/2;
   
   else sent=max/2-C[i];
   
   //printf("%d到%d号站点，目前层数%d,back:%d sent:%d\n",0,i,level,back,sent);
   
   dfs(N,minTime,sentmin,backmin,Sp,Time,level,C,minway,way,i,max,sent,back);
  
  }
 
 }
 
 if(sentmin==INT_MAX||backmin==INT_MAX)
 {
  sentmin=0;backmin=0;
  }
 
 printf("%d 0",sentmin);
 
 
 for(i=1;minway[i]!=-1;i++)
 {
  printf("->%d",minway[i]);
 
 }
 
 printf(" %d",backmin);
 

}