uva 10525

使用Floyd，判斷式需要符合他的形式

 

//
//        GGGGGGGGGGGGG        CCCCCCCCCCCCC               AAA
//     GGG::::::::::::G     CCC::::::::::::C              A:::A
//   GG:::::::::::::::G   CC:::::::::::::::C             A:::::A
//  G:::::GGGGGGGG::::G  C:::::CCCCCCCC::::C            A:::::::A
// G:::::G       GGGGGG C:::::C       CCCCCC           A:::::::::A
//G:::::G              C:::::C                        A:::::A:::::A
//G:::::G              C:::::C                       A:::::A A:::::A
//G:::::G    GGGGGGGGGGC:::::C                      A:::::A   A:::::A
//G:::::G    G::::::::GC:::::C                     A:::::A     A:::::A
//G:::::G    GGGGG::::GC:::::C                    A:::::AAAAAAAAA:::::A
//G:::::G        G::::GC:::::C                   A:::::::::::::::::::::A
// G:::::G       G::::G C:::::C       CCCCCC    A:::::AAAAAAAAAAAAA:::::A
//  G:::::GGGGGGGG::::G  C:::::CCCCCCCC::::C   A:::::A             A:::::A
//   GG:::::::::::::::G   CC:::::::::::::::C  A:::::A               A:::::A
//     GGG::::::GGG:::G     CCC::::::::::::C A:::::A                 A:::::A
//        GGGGGG   GGGG        CCCCCCCCCCCCCAAAAAAA                   AAAAAAA
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
#include <ctime>
using namespace std;
#ifdef DEBUG
#define debug(...) printf("DEBUG: "),printf(__VA_ARGS__)
#define gettime() end_time=clock();printf("now running time is %.7f\n",(float)(end_time - start_time)/CLOCKS_PER_SEC);
#else
#define debug(...)
#define gettime()
#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 105
#define PII pair<int,int>
#define PB push_back
#define oo (1<<29)
#define Set_oo 0x3f
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define eps 1e-6
clock_t start_time=clock(), end_time;
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 n,m,q;
struct inf{
    int time,dist;
    bool operator<(inf &d)const{
        if(time==d.time)return dist<d.dist;
        return time<d.time;
    }
    inf operator+(inf &d)const{
        inf ans;
        ans.time=time+d.time;
        ans.dist=dist+d.dist;
        return ans;
    }
};
inf mz[M][M];
int con[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];
                    con[i][j]=1;
                }
            }
        }
    }
}
inf solve(int x,int y){
    inf tmp;
    tmp.time=mz[x][y].time;
    tmp.dist=mz[x][y].dist;
    return tmp;
}
int main() {
    ios_base::sync_with_stdio(0);
    int test;
    scanf("%d",&test);
    while(test--){
        scanf("%d%d",&n,&m);
        for(int i=0;i<n;i++){
            for(int j=i;j<n;j++){
                if(i==j){
                    mz[i][j].time=0;
                    mz[i][j].dist=0;
                }else{
                    mz[i][j].time=mz[j][i].time=oo;
                    mz[i][j].dist=mz[j][i].dist=oo;
                }
            }
        }
        for(int i=0;i<m;i++){
            int x,y,w,z;
            scanf("%d%d%d%d",&x,&y,&w,&z);
            x--;y--;
            mz[x][y].time=mz[y][x].time=min3(mz[y][x].time,mz[x][y].time,w);
            mz[x][y].dist=mz[y][x].dist=min3(mz[y][x].dist,mz[x][y].dist,z);
        }
        scanf("%d",&q);
        floyd();
        int x,y;
        while(q--){
            scanf("%d%d",&x,&y);
            x--;y--;
            inf ans=solve(x,y);
            if(ans.time!=oo)printf("Distance and time to reach destination is %d & %d.\n",ans.dist,ans.time);
            else printf("No Path.\n");
        }
        if(test)Pln();
    }

















}