本题要求你实现一个天梯赛专属在线地图,队员输入自己学校所在地和赛场地点后,该地图应该推荐两条路线:一条是最快到达路线;一条是最短距离的路线。题目保证对任意的查询请求,地图上都至少存在一条可达路线。
输入格式:
输入在第一行给出两个正整数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
解题思路
建图,然后求两次最短路,因为求最快的路时要用到最短的路,所以先求最短的路,再求最快的路。用pre记录每个节点的上一个节点来记录路径。
代码如下
#include <iostream>
#include <cstring>
#include <stack>
#define maxn 505
#define INF 0x3f3f3f3f
using namespace std;
int g1[maxn][maxn];
int dis1[maxn];
int g2[maxn][maxn];
int dis2[maxn];
int by[maxn];
bool vis[maxn];
int pre1[maxn], pre2[maxn];
int s, t;
int n, m;
int main()
{
cin >> n >> m;
for(int i = 0; i < n; i ++){
for(int j = 0; j < n; j ++)
g2[i][j] = g1[i][j] = INF;
g1[i][i] = 0;
g2[i][i] = 0;
}
for(int i = 0; i < m; i ++){
int x, y, o, len, t;
cin >> x >> y >> o >> len >> t;
g1[x][y] = len;
g2[x][y] = t;
if(!o){
g1[y][x] = len;
g2[y][x] = t;
}
}
cin >> s >> t;
for(int i = 0; i < n; i ++){
dis1[i] = g1[s][i];
dis2[i] = g2[s][i];
by[i] = INF;
}
by[s] = 1;
memset(vis, 0, sizeof(vis));
for(int i = 1; i < n; i ++){
int minn = INF;
int k = -1;
for(int j = 0; j < n; j ++){
if(!vis[j] && dis1[j] < minn){
minn = dis1[j];
k = j;
}
}
vis[k] = true;
//cout << k << endl;
for(int j = 0; j < n; j ++){
if(!vis[j] && g1[k][j] != INF){
if(dis1[j] > dis1[k] + g1[k][j]){
dis1[j] = dis1[k] + g1[k][j];
by[j] = by[k] + 1;
pre1[j] = k;
}
else if(dis1[j] == dis1[k] + g1[k][j] && by[j] > by[k] + 1){
by[j] = by[k] + 1;
pre1[j] = k;
}
}
}
}
memset(vis, 0, sizeof(vis));
int dist[maxn];
for(int i = 0; i < n; i ++)
dist[i] = INF;
dist[s] = 0;
for(int i = 1; i < n; i ++){
int minn = INF;
int k = -1;
for(int j = 0; j < n; j ++){
if(!vis[j] && dis2[j] < minn){
minn = dis2[j];
k = j;
}
}
vis[k] = true;
//cout << k << endl; //
for(int j = 0; j < n; j ++){
if(!vis[j] && g2[k][j] != INF){
if(dis2[j] > dis2[k] + g2[k][j]){
dis2[j] = dis2[k] + g2[k][j];
dist[j] = dist[k] + g1[k][j];
pre2[j] = k;
}
else if(dis2[j] == dis2[k] + g2[k][j] && dist[j] > dist[k] + g1[k][j]){
dist[j] = dist[k] + g1[k][j];
pre2[j] = k;
}
}
}
}
stack<int> sta1, sta2;
int now = t;
while(now != s){
sta2.push(now);
now = pre2[now];
}
now = t;
while(now != s){
sta1.push(now);
now = pre1[now];
}
if(sta1 == sta2){
cout << "Time = " << dis2[t] << "; Distance = " << dis1[t] << ": " << s;
while(!sta2.empty()){
int top = sta2.top();
sta2.pop();
cout << " => " << top;
}
cout << endl;
}
else {
cout << "Time = " << dis2[t] << ": " << s;
while(!sta2.empty()){
int top = sta2.top();
sta2.pop();
cout << " => " << top;
}
cout << endl;
cout << "Distance = " << dis1[t] << ": " << s;
while(!sta1.empty()){
int top = sta1.top();
sta1.pop();
cout << " => " << top;
}
cout << endl;
}
return 0;
}