USACO:Bessie Come Home解题报告

思路：很简单的最短路径问题，dijkstra即可解。本题规模很小，也可用floyd-warshalll来解。唯一需要注意的一点是：两个节点之间可能有多个不同权值的路径连接，输入的时候注意判断只取最小的那个权值。

 

 

/*
ID: xpli1
PROG: comehome
LANG: C
*/

#include <stdio.h>
#include <math.h>
#include <ctype.h>

#define max(a,b) (((a) > (b)) ? (a) : (b))
#define min(a,b) (((a) < (b)) ? (a) : (b))

#define INT_MAX 0x7fff
#define IN stdin
#define OUT stdout

int weight[52][52];
int dis[52];
int flag[52];
int cow[52];
int N;

void dijkstra(int s,int n)
{
 int i,j;
 for(i=0; i<n; i++){
  dis[i] = weight[s][i];
  flag[i] = 0;
 }

 flag[s] = 1;
 dis[s] = 0;

 for(i=0; i<n; i++){
  int MIN = INT_MAX,v;

  for(j=0; j<n; j++){
   if(!flag[j]){
    if(dis[j] < MIN) {MIN = dis[j]; v = j;}
   }
  }

  flag[v] = 1;

  for(j=0; j<n; j++){
   if(!flag[j] && (MIN + weight[v][j] < dis[j])){
    dis[j] = MIN + weight[v][j];
   }
  }
 }

 return;
}

int main(void)
{
 FILE* fin = fopen("comehome.in","r");
 FILE* fout = fopen("comehome.out","w");

 int i,j;
 for(i=0; i<52; i++){
  for(j=0; j<52; j++){
   weight[i][j] = INT_MAX;
  }
 }

 fscanf(IN,"%d",&N);

 for(i=0; i<N; i++){
  char ca,cb;
  int ia,ib,w;
  fscanf(IN,"/n%c %c %d",&ca,&cb,&w);
  ia = islower(ca) ? ca - 'a' : ca - 'A' + 26;
  if(ia >= 26) cow[ia] = 1;
  ib = islower(cb) ? cb - 'a' : cb - 'A' + 26;
  if(ib >= 26) cow[ib] = 1;
  if(weight[ia][ib] > w)
   weight[ia][ib] = weight[ib][ia] = w;
 }

 dijkstra(51,52);

 int fast = INT_MAX;
 char COW;
 for(i=0; i<51; i++){
  if(cow[i] && fast > dis[i]){
   fast = dis[i];
   COW = (char)('A'+i-26);
  }
 }
 
 fprintf(OUT,"%c %d/n",COW,fast);

 return 0;
}