L3-007 天梯地图 (30 分)(两次dijkstra)

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
#include "bits/stdc++.h"
using namespace std;
int from, dist;
int len_table[600][600];
int len_prev[600];
int len_dis[600];
int len_point[600];
int len_vis[600];
int tim_table[600][600];
int tim_vis[600];
int tim_len[600];
int tim_prev[600];
int tim_dis[600];
queue<int> len_ans, tim_ans;
void len_getans(int i){
if(i == -1) return;
len_getans(len_prev[i]);
len_ans.push(i);
}
void tim_getans(int i){
if(i == -1) return;
tim_getans(tim_prev[i]);
tim_ans.push(i);
}
bool queue_cmp(queue<int> a, queue<int> b){
if(a.size() != b.size()) return false;
else{
while(!a.empty()){
if(a.front() != b.front()) return false;
a.pop();
b.pop();
}
return true;
}
}
int main(){
memset(len_point, 0x3f, 2400);
memset(len_dis, 0x3f, 2400);
memset(len_table, 0x3f, 2400 * 600);
memset(tim_table, 0x3f, 2400 * 600);
memset(len_vis, 0, 2400);
memset(tim_vis, 0, 2400);
memset(tim_len, 0x3f, 2400);
memset(tim_dis, 0x3f, 2400);
int pn, n;
scanf("%d %d", &pn, &n);
int p1, p2, one_way, length, time;
for(int i = 0; i < n; ++i){
scanf("%d %d %d %d %d", &p1, &p2, &one_way, &length, &time);
len_table[p1][p2] = length;
tim_table[p1][p2] = time;
if(!one_way) {
len_table[p2][p1] = length;
tim_table[p2][p1] = time;
}
}
scanf("%d %d", &from, &dist);
//
len_point[from] = 1;
len_dis[from] = 0;
len_prev[from] = -1;
while(true){
int p = -1;
int short_dis = 0x3f3f3f3f;
for(int i = 0; i < pn; ++i){
if(short_dis > len_dis[i] && !len_vis[i]){
short_dis = len_dis[i];
p = i;
}
}
if(p == -1) break;
len_vis[p] = 1;
for(int i = 0; i < pn; ++i){
if(0x3f3f3f3f != len_table[p][i] && len_dis[i] >= len_dis[p] + len_table[p][i]){
if(len_dis[i] > len_dis[p] + len_table[p][i] ||
(len_dis[i] == len_dis[p] + len_table[p][i] && len_point[i] > len_point[p] + 1)
){
len_dis[i] = len_dis[p] + len_table[p][i];
len_point[i] = len_point[p] + 1;
len_prev[i] = p;
}
}
}
}
tim_len[from] = 0;
tim_prev[from] = -1;
tim_dis[from] = 0;
while(true){
int p = -1;
int mintime = 0x3f3f3f3f;
for(int i = 0; i < pn; ++i){
if(tim_dis[i] < mintime && !tim_vis[i]){
mintime = tim_dis[i];
p = i;
}
}
if(p == -1) break;
tim_vis[p] = 1;
for(int i = 0; i < pn; ++i){
if(0x3f3f3f3f != tim_table[p][i] && tim_table[p][i] + tim_dis[p] <= tim_dis[i]){
if(tim_table[p][i] + tim_dis[p] < tim_dis[i] ||
(tim_table[p][i] + tim_dis[p] == tim_dis[i] && tim_len[p] + len_table[p][i] < tim_len[i])){
tim_len[i] = tim_len[p] + len_table[p][i];
tim_prev[i] = p;
tim_dis[i] = tim_table[p][i] + tim_dis[p];
}
}
}
}
//
tim_getans(dist);
len_getans(dist);
if(queue_cmp(len_ans, tim_ans)){
printf("Time = %d; Distance = %d: ", tim_dis[dist], len_dis[dist]);
int len_cnt = 0;
while(!len_ans.empty()){
if(len_cnt) printf(" => ");
printf("%d", len_ans.front());
len_ans.pop();
len_cnt++;
}
return 0;
}
printf("Time = %d: ", tim_dis[dist]);
int tim_cnt = 0;
while(!tim_ans.empty()){
if(tim_cnt) printf(" => ");
printf("%d", tim_ans.front());
tim_ans.pop();
tim_cnt++;
}
printf("nDistance = %d: ", len_dis[dist]);
int len_cnt = 0;
while(!len_ans.empty()){
if(len_cnt) printf(" => ");
printf("%d", len_ans.front());
len_ans.pop();
len_cnt++;
}
return 0;
}