L3-007 天梯地图 （30 分)

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
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
#include <bits/stdc++.h>
#define ll long long
const ll inf = 1e9 + 7;
using namespace std;
vector<int>s1, t1;
int s[505][505], t[505][505], dis[505], pre[505], cnt[505];
int n, m, a, b, c, d, e, ss, ee, ans1, ans2;
bool book[505];
void print1(int k)
{
if (k == ss)
{
s1.push_back(k);
return;
}
print1(pre[k]);
s1.push_back(k);
}
void print2(int k)
{
if (k == ss)
{
t1.push_back(k);
return;
}
print2(pre[k]);
t1.push_back(k);
}
int main()
{
scanf("%d%d", &n, &m);
fill(s[0], s[0] + 505 * 505, inf);
fill(t[0], t[0] + 505 * 505, inf);
while (m--)
{
scanf("%d%d%d%d%d", &a, &b, &c, &d, &e);
if (c == 1)
{
s[a][b] = d;
t[a][b] = e;
}
else
{
s[a][b] = d;
s[b][a] = d;
t[a][b] = e;
t[b][a] = e;
}
}
scanf("%d%d", &ss, &ee);
//距离
fill(dis, dis + 505, inf);
dis[ss] = 0;
for (int i = 0; i < n; i++)
{
int f = -1, minn = inf;
for (int j = 0; j < n; j++)
{
if (book[j] == false && dis[j] < minn)
{
minn = dis[j];
f = j;
}
}
if (f == -1)
break;
book[f] = true;
for (int j = 0; j < n; j++)
{//cnt是时间
if (book[j] == false && dis[j] > dis[f] + s[f][j])
{
dis[j] = dis[f] + s[f][j];
cnt[j] = cnt[f] + 1;
pre[j] = f;
}
else if (book[j] == false && dis[j] == dis[f] + s[f][j])
{
if (cnt[j] > cnt[f] + 1)
{
cnt[j] = cnt[f] + 1;
pre[j] = f;
}
}
}
}
ans1 = dis[ee];
print1(ee);
//时间
memset(cnt, 0, sizeof(cnt));
memset(book, false, sizeof(book));
fill(dis, dis + 505, inf);
dis[ss] = 0;
for (int i = 0; i < n; i++)
{
int f = -1, minn = inf;
for (int j = 0; j < n; j++)
{
if (book[j] == false && dis[j] < minn)
{
minn = dis[j];
f = j;
}
}
if (f == -1)
break;
book[f] = true;
for (int j = 0; j < n; j++)
{//cnt是点数
if (book[j] == false && dis[j] > dis[f] + t[f][j])
{
cnt[j] = cnt[f] + s[f][j];
dis[j] = dis[f] + t[f][j];
pre[j] = f;
}
else if (book[j] == false && dis[j] == dis[f] + t[f][j])
{
if (cnt[j] > cnt[f] + s[f][j])
{
cnt[j] = cnt[f] + s[f][j];
pre[j] = f;
}
}
}
}
ans2 = dis[ee];
print2(ee);
if (s1.size() == t1.size())
{
for (int i = 0; i < s1.size(); i++)
if (s1[i] != t1[i])
goto qwe;
printf("Time = %d; Distance = %d: ", ans2, ans1);
for (int i = 0; i < s1.size(); i++)
{
printf("%d", s1[i]);
if (i != s1.size() - 1)
printf(" => ");
}
system("pause");
return 0;
}
qwe:;
printf("Time = %d: ", ans2);
for (int i = 0; i < t1.size(); i++)
{
printf("%d", t1[i]);
if (i != t1.size() - 1)
printf(" => ");
}
printf("nDistance = %d: ", ans1);
for (int i = 0; i < s1.size(); i++)
{
printf("%d", s1[i]);
if (i != s1.size() - 1)
printf(" => ");
}
system("pause");
}