Red Huang

Red Huang

uva 11047

利用 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("抱歉,%s 先生,您無法從 %s 前往 %s\\n",str1,str2,str3);  
                continue;  
            }  
            printf("%s 先生,從 %s 前往 %s,您將獲得 %d 歐元\\n路徑:",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);  
        }  
    }  
  
}  

載入中......
此文章數據所有權由區塊鏈加密技術和智能合約保障僅歸創作者所有。