UVA - 10525 - New to Bangladesh?

#include<bits/stdc++.h>

using namespace std;

#define pf(x) printf("%d",x)
#define pfd(x,y) printf("%d %d",x,y)
#define pfl(x) printf("%ld",x)
#define nl printf("\n")

#define cs(x) printf("Case %d: ",x)
#define csn(x) printf("Case %d:\n",x)

#define all(x) x.begin(),x.end()
#define Find(x,n) find(all(x),n)
#define pi acos(-1.0)
#define i64 long long
#define pb(x) push_back(x)
#define mset(x,v) memset(x,v,sizeof(x))
#define sc(n) scanf("%d",&n)
#define scl(n) scanf("%ld",&n)
#define scll(n) scanf("%lld",&n)
#define scd(n,m) scanf("%d %d",&n,&m)
#define scdl(n,m) scanf("%ld %ld",&n,&m)
#define scdll(n,m) scanf("%lld %lld",&n,&m)
#define filein freopen("in.txt","r",stdin)
#define fileout freopen("my.txt","w",stdout)
#define FOR(i,n) for(int i=0;i<n; i++)
#define inf 200000000

bool isUpper(char ch){ if( ch>='A' && ch<='Z' ) return true; return false; }
bool isLower(char ch){ if( ch>='a' && ch<='z') return true; return false;}
bool isLetter(char ch){ if( ch>='A' && ch<='Z' || ch>='a' && ch<='z') return true; return false; }
bool isDigit(char ch){ if( ch>='0' && ch<='9') return true; return false; }
char toLower(char ch){ if (isUpper(ch)) return (ch+32); return ch; }
char toUpper(char ch){ if (isLower(ch)) return (ch-32); return ch; }

template<class T>bool isEven(T a){ return (a%2==0);}
template<class T>T sq(T a){ return a*a; }
template<class T>T gcd(T a,T b){ return b==0 ? a : gcd(b,a%b); }
template<class T>T lcm(T a,T b){ return (a/gcd(a,b))*b; }
template<class T>bool isPrime(T n){ for(T i=2; i*i<=n; i++){ if(n%i==0) return false; } return true; }
template<class T>T Pow(T n,T p) { T res=n; for(T i=1;i<p; i++){ res *= n; } return res; }
template<class T>T Max(T n,T p) { if(n>=p) return n; return p; }

i64 g[500][500];
i64 times[500][500];

void floyd_warshall(int n){
    for(int k=1;k<=n; k++)
        for(int i=1;i<=n; i++)
            for(int j=1;j<=n; j++)
                if( times[i][j]>times[i][k]+times[k][j] )
                        g[i][j]=g[i][k]+g[k][j],times[i][j]=times[i][k]+times[k][j];
                else if( (times[i][j]==times[i][k]+times[k][j]) && (g[i][j]>g[i][k]+g[k][j]) )
                        g[i][j]=(g[i][k]+g[k][j]),times[i][j]=times[i][k]+times[k][j];

}

void Set(int n){
    for(int i=1;i<=n; i++)
        for(int j=1;j<=n; j++)
            g[i][j]=inf,times[i][j]=inf;
}

int main()
{
    //filein;

    int t,T=0;
    int n,m,query;
    sc(t);
    while( t-- ){
        scanf("%d %d",&n,&m);
        Set(n);
        for(int i=1;i<=m;i++){
            int u,v;
            i64 w,tim;
            scanf("%d %d %lld %lld",&u,&v,&tim,&w);
            if( u== v) continue;
            if( tim<times[u][v] )
                times[u][v]=tim,times[v][u]=tim,g[u][v]=w,g[v][u]=w;
            else if(  tim==times[u][v] && g[u][v]>w  )
                times[u][v]=tim,times[v][u]=tim,g[u][v]=w,g[v][u]=w;
        }
        floyd_warshall(n);
        sc(query);
        if(T) nl;
        while(query--){
            int u,v;
            scanf("%d %d",&u,&v);
            if( u==v )
                printf("Distance and time to reach destination is %d & %d.\n",0,0);
            else if( g[u][v]==inf )
                printf("No Path.\n");
            else
                printf("Distance and time to reach destination is %lld & %lld.\n",g[u][v],times[u][v]);
        }
        ++T;
    }
    return 0;
}