利用floyd並且記錄路徑,首次學習了
//============================================================================
// Name : The Scrooge Co Problem.cpp
// Date : 2013/4/2 下午7:39:19
// Author : GCA
//============================================================================
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
using namespace std;
#ifdef ONLINE_JUDGE
#define ll "%lld"
#else
#define ll "%I64d"
#endif
typedef unsigned int uint;
typedef long long int Int;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\n")
#define I_de(x,n)for(int i=0;i<n;i++)printf("%d ",x[i]);Pln()
#define De(x)printf(#x"%d\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\
printf("%d ",dp[htx][hty]);}Pln();}
#define M 110
#define PII pair<int,int>
#define PB push_back
#define oo (INT_MAX>>1)
#define Set_oo 0x3f
#define Is_debug true
#define debug(...) if(Is_debug)printf("DEBUG: "),printf(__VA_ARGS__)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define eps 1e-6
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
int tmp=min(x,y);
return min(tmp,z);
}
int max3(int x,int y,int z){
int tmp=max(x,y);
return max(tmp,z);
}
int mz[M][M];
char sid[M][30];
map<string,int> rsid;
int n;
int path[M][M];
void floyd(){
for(int k=0;k<n;k++){
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(mz[i][k]+mz[k][j]<mz[i][j]){
mz[i][j]=mz[i][k]+mz[k][j];
path[i][j]=path[i][k];
}
}
}
}
}
int main() {
ios_base::sync_with_stdio(0);
int test;
scanf("%d",&test);
while(test--){
rsid.clear();
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%s",sid[i]);
rsid[sid[i]]=i;
}
int tmp;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
scanf("%d",&tmp);
if(tmp==-1)mz[i][j]=oo;
else mz[i][j]=tmp;
path[i][j]=j;
}
}
// Pmz(mz,n,n);
floyd();
// Pln();
// Pmz(mz,n,n);
int q;
scanf("%d",&q);
char str1[30],str2[30],str3[30];
for(int i=0;i<q;i++){
scanf("%s%s%s",str1,str2,str3);
int x=rsid[str2];
int y=rsid[str3];
int ans=mz[x][y];
// debug("%d %d\n",x,y);
if(ans==oo){
printf("Sorry Mr %s you can not go from %s to %s\n",str1,str2,str3);
continue;
}
printf("Mr %s to go from %s to %s, you will receive %d euros\nPath:",str1,str2,str3,ans);
printf("%s",str2);
for(x=path[x][y];x!=y;x=path[x][y]){
printf(" %s",sid[x]);
}printf(" %s\n",str3);
}
}
}
留言
張貼留言