1111 Online Map

题目描述
知识点： 最短路径
思路： 本题为多关键字的最短路径，做过很多遍了。这里不是用DFS，就是直接在求的时候记录了。如果第一关键字相等的话选取第二关键字更好的路径并及时更新。
本题需要两遍迪杰斯特拉，写的复杂了。

#include<iostream>
#include<cstring>
#include<vector>
using namespace std;
const int N = 510;
int ti[N][N],d[N][N],dist[N],v[N];
int m,n,s,e;
int shortest_p[N],faster_p[N];
vector<int> res1,res2;
void find_shortest(){
    memset(dist,0x3f,sizeof dist);
    int p[N];
    memset(p,0x3f,sizeof p);
    dist[s] = 0;
    p[s] = 0;
    shortest_p[s] = -1;
    for(int i = 0;i < n;i++){
        int t = -1;
        for(int j = 0;j < n;j++)
            if(!v[j] && (t == -1 || dist[j] < dist[t]))
                t = j;
        v[t] = 1;
        for(int j = 0;j < n;j++){
            if(!v[j] && dist[j] >= dist[t] + d[t][j]){
                if(dist[t] + d[t][j] == dist[j] && p[t] + ti[t][j] <= p[j]){
                    p[j] = p[t] + ti[t][j];
                    shortest_p[j] = t;
                }
                else if(dist[t] + d[t][j] < dist[j]){
                    p[j] = p[t] + ti[t][j];
                    shortest_p[j] = t;
                    dist[j] =  dist[t] + d[t][j];
                }
            }
        }
    }
}
void find_fastest(){
    memset(v,0,sizeof v);
    memset(dist,0x3f,sizeof dist);
    int p[N];
    memset(p,0x3f,sizeof p);
    dist[s] = 0;
    p[s] = 0;
    faster_p[s] = -1;
    for(int i = 0;i < n;i++){
        int t = -1;
        for(int j = 0;j < n;j++)
            if(!v[j] && (t == -1 || dist[j] < dist[t]))
                t = j;
        v[t] = 1;
        for(int j = 0;j < n;j++){
            if(!v[j] && dist[j] >= dist[t] + ti[t][j]){
                if(dist[t] + ti[t][j] == dist[j] && p[t]+1<= p[j]){
                    p[j] = p[t]+1;
                    faster_p[j] = t;
                }
                else if(dist[t] + ti[t][j] < dist[j]){
                    p[j] = p[t] + 1;
                    faster_p[j] = t;
                    dist[j] =  dist[t] + ti[t][j];
                }
            }
        }
    }
}
int main(){
    cin>>n>>m;
    memset(ti,0x3f,sizeof ti);
    memset(d,0x3f,sizeof d);
    for(int i = 0;i < m;i++){
        int a,b,c,dd,e;
        cin>>a>>b>>c>>dd>>e;
        if(c == 0){
            ti[a][b] = ti[b][a] = e;
            d[a][b] = d[b][a] = dd;
        }else{
            ti[a][b] = e;
            d[a][b] = dd;
        }
    }
    cin>>s>>e;
    find_shortest();
    int cost_d = 0,cost_t = 0;
    int u = e;
    while(u != -1){
        res1.push_back(u);
        if(shortest_p[u] != -1)
            cost_d += d[shortest_p[u]][u];
        u = shortest_p[u];
    }
    find_shortest();
    find_fastest();
    u = e;
    while(u != -1){
        res2.push_back(u);
        if(shortest_p[u] != -1)
            cost_t += ti[faster_p[u]][u];        
        u = faster_p[u];
    } 
    bool is_same = true;
    if(res1.size() != res2.size()) is_same = false;
    for(int i = 0;i < res1.size() && i < res2.size();i++)
        if(res1[i] != res2[i]) is_same = false;
    if(is_same){
        printf("Distance = %d; Time = %d: ",cost_d,cost_t);
        printf("%d",res1[res1.size()-1]);
        for(int i = res1.size()-2;i >= 0;i--)
            printf(" -> %d",res1[i]);     
    }else{
        printf("Distance = %d: ",cost_d);
        printf("%d",res1[res1.size()-1]);
        for(int i = res1.size()-2;i >= 0;i--)
            printf(" -> %d",res1[i]);  
        printf("\nTime = %d: ",cost_t);
        printf("%d",res2[res2.size()-1]);
        for(int i = res2.size()-2;i >= 0;i--)
            printf(" -> %d",res2[i]);         
    }
    return 0;
}