#include<stdio.h> int main() { int n,t; int count = 1; while(scanf("%d %d",&n,&t) != EOF) { int way[t][2]; int i,j; for(i = 0;i < t;i++) { scanf("%d %d %d",&way[i][0],&way[i][1],&way[i][2]); } int w,e,sum = 0; scanf("%d %d",&w,&e); int path[w][1]; for(i = 0;i < w;i++) { scanf("%d %d",&path[i][0],&path[i][1]); int min = 9999; for(j = 0;j < t;j++) { if(path[i][0] == way[j][0]&&path[i][1] == way[j][1]||path[i][0] == way[j][1]&&path[i][1] == way[j][0]) { if(min > way[j][2]) { min = way[j][2]; } } } sum += min; if(path[i][1] == e) break; } printf("Case #%d: %d\n",count++,sum); } return 0; } |
Double click to view unformatted code.