PAT(A)1111 Online Map (30)(最短路)

记录一个菜逼的成长。。

题目大意：
给你n个点，m条路。
接下来m行，V1 V2 one-way length time
one-way 表示是不是单向边，1是0否
求最短和最快的距离和时间 并输出路径。
如果路径不一样，则按一下格式输出
Distance = D: source -> v1 -> … -> destination
Time = T: source -> w1 -> … -> destination
否则按一下格式输出
Distance = D; Time = T: source -> u1 -> … -> destination

一道算是经典的旅游规划类题吧。
用了两个dijkstra函数分别求出最短和最快的路线。
再判断路径是否一样。

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <cstdio>
#include <iostream>
#include <cstring>
#include <string>
#include <algorithm>
#include <cstdlib>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <deque>
#include <cctype>
#include <bitset>
#include <cmath>
#include <cassert>
using namespace std;
#define ALL(v) (v).begin(),(v).end()
#define cl(a,b) memset(a,b,sizeof(a))
#define bp __builtin_popcount
#define pb push_back
#define mp make_pair
#define fin freopen("D://in.txt","r",stdin)
#define fout freopen("D://out.txt","w",stdout)
#define lson t<<1,l,mid
#define rson t<<1|1,mid+1,r
#define seglen (node[t].r-node[t].l+1)
#define pi 3.1415926
#define exp  2.718281828459
#define lowbit(x) (x)&(-x)
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int,int> PII;
typedef pair<LL,LL> PLL;
typedef vector<PII> VPII;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
template <typename T>
inline void read(T &x){
    T ans=0;
    char last=' ',ch=getchar();
    while(ch<'0' || ch>'9')last=ch,ch=getchar();
    while(ch>='0' && ch<='9')ans=ans*10+ch-'0',ch=getchar();
    if(last=='-')ans=-ans;
    x = ans;
}
const int maxn = 500 + 10;
int dist[maxn][maxn],tim[maxn][maxn];
int dis[maxn],Time[maxn],len[maxn],vis[maxn];
int path[maxn],path1[maxn];
void init(int n)
{
    for( int i = 0; i < n; i++ ){
        for( int j = 0; j < n; j++ ){
            dist[i][j] = INF;
            tim[i][j] = INF;
        }
    }
}
void dijkstra(int s,int n)
{
    cl(vis,0);
    cl(path,-1);
    fill(dis,dis+n,INF);
    fill(Time,Time+n,INF);
    dis[s] = 0;
    Time[s] = 0;
    for( int i = 1; i < n; i++ ){
        int x,mn = INF;
        for( int j = 0; j < n; j++ ){
            if(!vis[j] && mn > dis[j])mn = dis[x = j];
        }
        vis[x] = 1;
        for( int j = 0; j < n; j++ ){
            if(dis[j] > dis[x] + dist[x][j]){
                dis[j] = dis[x] + dist[x][j];
                Time[j] = Time[x] + tim[x][j];
                path[j] = x;
            }
            else if(dis[j] == dis[x] + dist[x][j]){
                if(Time[j] > Time[x] + tim[x][j]){
                    Time[j] = Time[x] + tim[x][j];
                    path[j] = x;
                }
            }
        }
    }
}
void dijkstra1(int s,int n)
{
    cl(vis,0);
    cl(path1,-1);
    fill(len,len+n,INF);
    len[s] = 0;
    for( int i = 1; i < n; i++ ){
        int x,mn = INF;
        for( int j = 0; j < n; j++ ){
            if(!vis[j] && mn > Time[j])mn = Time[x = j];
        }
        vis[x] = 1;
        for( int j = 0; j < n; j++ ){
            if(Time[j] > Time[x] + tim[x][j]){
                Time[j] = Time[x] + tim[x][j];
                len[j] = len[x] + 1;
                path1[j] = x;
            }
            else if(Time[j] == Time[x] + tim[x][j]){
                if(len[j] > len[x] + 1){
                    len[j] = len[x] + 1;
                    path1[j] = x;
                }
            }
        }
    }
}
int a[maxn],b[maxn];
int fun(int p[],int x,int st[])
{
    int ind = 0;
    while(x != -1){
        st[ind++] = x;
        x = p[x];
    }
    return ind;
}
bool check(int a[],int b[],int ind1,int ind2)
{
    if(ind1 != ind2)return false;
    for( int i = 0; i < ind1; i++ ){
        if(a[i] != b[i])return false;
    }
    return true;
}
int main()
{
    int n,m;
    while(~scanf("%d%d",&n,&m)){
        init(n);
        int u,v,flag,lenth,tm;
        for( int i = 0; i < m; i++ ){
            scanf("%d%d%d%d%d",&u,&v,&flag,&lenth,&tm);
            dist[u][v] = lenth;
            tim[u][v] = tm;
            if(!flag){
                dist[v][u] = lenth;
                tim[v][u] = tm;
            }
        }
        int s,e;
        scanf("%d%d",&s,&e);
        dijkstra(s,n);
        dijkstra1(s,n);
        int ind1 = fun(path,e,a);
        int ind2 = fun(path1,e,b);
        if(check(a,b,ind1,ind2)){
            printf("Distance = %d; Time = %d: ",dis[e],Time[e]);
            for( int i = ind1 - 1; i >= 0; i-- ){
                if(i == ind1 - 1){
                    printf("%d",a[i]);
                }
                else printf(" -> %d",a[i]);
            }
            puts("");
        }
        else{
            printf("Distance = %d: ",dis[e]);
            for( int i = ind1 - 1; i >= 0; i-- ){
                if(i == ind1 - 1)printf("%d",a[i]);
                else printf(" -> %d",a[i]);
            }
            printf("\nTime = %d: ",Time[e]);
            for( int i = ind2 - 1; i >= 0; i-- ){
                if(i == ind2 - 1)printf("%d",b[i]);
                else printf(" -> %d",b[i]);
            }
            puts("");
        }
    }
    return 0;
}