PTA 团体程序设计天梯赛-练习集 L3-007 天梯地图 (30分)

本题要求你实现一个天梯赛专属在线地图，队员输入自己学校所在地和赛场地点后，该地图应该推荐两条路线：一条是最快到达路线；一条是最短距离的路线。题目保证对任意的查询请求，地图上都至少存在一条可达路线。

输入格式：

输入在第一行给出两个正整数N（2 ≤ N ≤ 500）和M，分别为地图中所有标记地点的个数和连接地点的道路条数。随后M行，每行按如下格式给出一条道路的信息：

V1 V2 one-way length time

其中V1和V2是道路的两个端点的编号（从0到N-1）；如果该道路是从V1到V2的单行线，则one-way为1，否则为0；length是道路的长度；time是通过该路所需要的时间。最后给出一对起点和终点的编号。

输出格式：

首先按下列格式输出最快到达的时间T和用节点编号表示的路线：

Time = T: 起点 => 节点1 => ... => 终点

然后在下一行按下列格式输出最短距离D和用节点编号表示的路线：

Distance = D: 起点 => 节点1 => ... => 终点

如果最快到达路线不唯一，则输出几条最快路线中最短的那条，题目保证这条路线是唯一的。而如果最短距离的路线不唯一，则输出途径节点数最少的那条，题目保证这条路线是唯一的。

如果这两条路线是完全一样的，则按下列格式输出：

Time = T; Distance = D: 起点 => 节点1 => ... => 终点

输入样例1：

10 15
0 1 0 1 1
8 0 0 1 1
4 8 1 1 1
5 4 0 2 3
5 9 1 1 4
0 6 0 1 1
7 3 1 1 2
8 3 1 1 2
2 5 0 2 2
2 1 1 1 1
1 5 0 1 3
1 4 0 1 1
9 7 1 1 3
3 1 0 2 5
6 3 1 2 1
5 3

输出样例1：

Time = 6: 5 => 4 => 8 => 3
Distance = 3: 5 => 1 => 3

输入样例2：

7 9
0 4 1 1 1
1 6 1 3 1
2 6 1 1 1
2 5 1 2 2
3 0 0 1 1
3 1 1 3 1
3 2 1 2 1
4 5 0 2 2
6 5 1 2 1
3 5

输出样例2：

Time = 3; Distance = 4: 3 => 2 => 5

两次的Dijkstra,就是两遍的 L2-01紧急救援,本以为需要堆优化版本的Dijkstra谁知道直接裸模板也可以过

第一次写超过100行的代码,这次的代码有点啰嗦

#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
using namespace std;
const int N = 510 * 510;
int cost[510][510];
int fa[510],dist[510],h[510],load_cost[510],cnt[510],vis[N],ne[N],w[N],e[N];
int idx,n,m,s,d,dist_min,cost_min;
vector<int> dist_vect,cost_vect;
void add(int x,int y,int z){
    e[idx] = y;
    w[idx] = z;
    ne[idx] = h[x];
    h[x] = idx++;
}

void dijkstra(){
    memset(dist,0x3f,sizeof dist);
    dist[s] = 0;
    cnt[s] = 1;
    for (int i = 0; i < n; ++i){
        int u = -1,min_dist = 0x3f3f3f3f;
        for (int j = 0; j < n; ++j){
            if (vis[j] == 0 && min_dist > dist[j]){
                min_dist = dist[j];
                u = j;
            }
        }
        vis[u] = 1;
        for (int j = h[u]; j != -1; j = ne[j]){
            int node  = e[j],weight = w[j];
            if (dist[node] > dist[u] + weight){
                fa[node] = u;
                dist[node] = dist[u] + weight;
                cnt[node] = cnt[u] + 1;
            }else if(dist[node] == dist[u] + weight && cnt[node] > cnt[u] + 1){
                fa[node] = u;
                cnt[node] = cnt[u] + 1;
            }
        }
    }
}

void cost_dijkstra(){
    memset(dist,0x3f,sizeof dist);
    memset(load_cost,0x3f,sizeof load_cost);
    dist[s] = 0;
    load_cost[s] = 0;
    for (int i = 0; i < n; ++i){
        int u = -1,min_dist = 0x3f3f3f3f;
        for (int j = 0; j < n; ++j){
            if (vis[j] == 0 && min_dist > load_cost[j]){
                min_dist = load_cost[j];
                u = j;
            }
        }
        vis[u] = 1;
        for (int j = h[u]; j != -1; j = ne[j]){
            int node  = e[j],weight = w[j];
            if (load_cost[node] > load_cost[u] + cost[u][node]){
                fa[node] = u;
                load_cost[node] = load_cost[u] + cost[u][node];
                dist[node] = dist[u] + weight;
            }else if (load_cost[node] == load_cost[u] + cost[u][node] && dist[node] > dist[u] + weight){
                fa[node] = u;
                dist[node] = dist[u] + weight;
            }
        }
    }
}

void dist_dfs(int d){
    if (fa[d] == d){
        dist_vect.push_back(d);
        return;
    }
    dist_dfs(fa[d]);
    dist_vect.push_back(d);
}

void cost_dfs(int d){
    if (fa[d] == d){
        cost_vect.push_back(d);
        return;
    }
    cost_dfs(fa[d]);
    cost_vect.push_back(d);
}

int main(){
    int v1,v2,one_way; double len,time;
    cin>>n>>m;
    memset(h,-1,sizeof h);
    for (int i = 0; i < m; ++i){
        scanf("%d%d%d%lf%lf",&v1,&v2,&one_way,&len,&time);
        cost[v1][v2] = time;
        add(v1,v2,len);
        if (one_way == 0) {
            cost[v2][v1] = time;
            add(v2,v1,len);
        }
    }
    cin>>s>>d;
    for (int i = 0; i < n; ++i) fa[i] = i;
    dijkstra();
    dist_min = dist[d];
    dist_dfs(d);
    for (int i = 0; i < n; ++i) fa[i] = i;
    memset(vis,0,sizeof vis);
    cost_dijkstra();
    cost_min = load_cost[d];
    cost_dfs(d);
    if (dist_vect == cost_vect){
        cout<<"Time = "<<cost_min<<"; Distance = "<<dist_min<<": ";
        for (int i = 0; i < dist_vect.size(); ++i){
            if (i) cout<<" => "<<dist_vect[i];
            else cout<<dist_vect[i];
        }
    }
    else{
        cout<<"Time = "<<cost_min<<": ";
        for (int i = 0; i < cost_vect.size(); ++i){
            if (i) cout<<" => "<<cost_vect[i];
            else cout<<cost_vect[i];
        }
        cout<<"\nDistance = "<<dist_min<<": ";
        for (int i = 0; i < dist_vect.size(); ++i){
            if (i) cout<<" => "<<dist_vect[i];
            else cout<<dist_vect[i];
        }
    }
    return 0;
}