#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
vector<pair<ll, ll>> graph[100001];
ll du[100001], dv[100001], ds[100001], dp[2][100001], ans;
bool visited[100001];
void dijkstra1(ll start, ll arr[]) {
fill(visited, visited + 100001, false);
priority_queue<pair<ll, ll>> pq;
pq.push({0, start});
while (!pq.empty()) {
ll c, node;
tie(c, node) = pq.top();
pq.pop();
if (!visited[node]) {
arr[node] = -c;
visited[node] = true;
for (auto &i : graph[node]) pq.push({c - i.second, i.first});
}
}
}
void dijkstra2(ll start, ll end) {
fill(dp[0], dp[0] + 100001, LLONG_MAX / 2);
fill(dp[1], dp[1] + 100001, LLONG_MAX / 2);
fill(visited, visited + 100001, false);
priority_queue<pair<ll, pair<ll, ll>>> pq;
pq.push({0, {start, 0}});
dp[0][0] = dp[1][0] = LLONG_MAX / 2;
while (!pq.empty()) {
ll c, node, par;
pair<ll, ll> p;
tie(c, p) = pq.top();
tie(node, par) = p;
pq.pop();
if (!visited[node]) {
visited[node] = true;
ds[node] = -c;
dp[0][node] = min(du[node], dp[0][par]);
dp[1][node] = min(dv[node], dp[1][par]);
for (auto i : graph[node]) pq.push({c - i.second, {i.first, node}});
} else if (-c == ds[node]) {
if (min(du[node], dp[0][par]) + min(dv[node], dp[1][par]) <=
dp[0][node] + dp[1][node]) {
dp[0][node] = min(du[node], dp[0][par]);
dp[1][node] = min(dv[node], dp[1][par]);
}
}
}
ans = min(ans, dp[0][end] + dp[1][end]);
}
int main() {
iostream::sync_with_stdio(false);
cin.tie(0);
ll n, m, s, t, u, v;
cin >> n >> m >> s >> t >> u >> v;
for (int i = 0; i < m; i++) {
ll a, b, c;
cin >> a >> b >> c;
graph[a].push_back({b, c});
graph[b].push_back({a, c});
}
dijkstra1(u, du);
dijkstra1(v, dv);
ans = du[v];
dijkstra2(s, t);
cout << ans << '\n';
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
299 ms |
30996 KB |
Output is correct |
2 |
Correct |
267 ms |
29848 KB |
Output is correct |
3 |
Correct |
274 ms |
26312 KB |
Output is correct |
4 |
Correct |
292 ms |
30136 KB |
Output is correct |
5 |
Correct |
252 ms |
25636 KB |
Output is correct |
6 |
Correct |
320 ms |
30856 KB |
Output is correct |
7 |
Correct |
276 ms |
29836 KB |
Output is correct |
8 |
Correct |
282 ms |
29736 KB |
Output is correct |
9 |
Correct |
295 ms |
31356 KB |
Output is correct |
10 |
Correct |
313 ms |
31432 KB |
Output is correct |
11 |
Correct |
69 ms |
13856 KB |
Output is correct |
12 |
Correct |
309 ms |
31468 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
295 ms |
30164 KB |
Output is correct |
2 |
Correct |
267 ms |
26248 KB |
Output is correct |
3 |
Correct |
283 ms |
26212 KB |
Output is correct |
4 |
Correct |
271 ms |
26320 KB |
Output is correct |
5 |
Correct |
267 ms |
26244 KB |
Output is correct |
6 |
Correct |
285 ms |
26460 KB |
Output is correct |
7 |
Correct |
260 ms |
26088 KB |
Output is correct |
8 |
Correct |
261 ms |
26248 KB |
Output is correct |
9 |
Correct |
269 ms |
26140 KB |
Output is correct |
10 |
Correct |
253 ms |
26216 KB |
Output is correct |
11 |
Correct |
60 ms |
13900 KB |
Output is correct |
12 |
Correct |
264 ms |
26544 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
33 ms |
7492 KB |
Output is correct |
2 |
Correct |
2 ms |
4356 KB |
Output is correct |
3 |
Correct |
2 ms |
4352 KB |
Output is correct |
4 |
Correct |
54 ms |
10536 KB |
Output is correct |
5 |
Correct |
25 ms |
8368 KB |
Output is correct |
6 |
Correct |
3 ms |
4436 KB |
Output is correct |
7 |
Correct |
4 ms |
4564 KB |
Output is correct |
8 |
Correct |
5 ms |
4692 KB |
Output is correct |
9 |
Correct |
3 ms |
4436 KB |
Output is correct |
10 |
Correct |
28 ms |
7440 KB |
Output is correct |
11 |
Correct |
2 ms |
4308 KB |
Output is correct |
12 |
Correct |
3 ms |
4348 KB |
Output is correct |
13 |
Correct |
3 ms |
4308 KB |
Output is correct |
14 |
Correct |
3 ms |
4436 KB |
Output is correct |
15 |
Correct |
3 ms |
4488 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
299 ms |
30996 KB |
Output is correct |
2 |
Correct |
267 ms |
29848 KB |
Output is correct |
3 |
Correct |
274 ms |
26312 KB |
Output is correct |
4 |
Correct |
292 ms |
30136 KB |
Output is correct |
5 |
Correct |
252 ms |
25636 KB |
Output is correct |
6 |
Correct |
320 ms |
30856 KB |
Output is correct |
7 |
Correct |
276 ms |
29836 KB |
Output is correct |
8 |
Correct |
282 ms |
29736 KB |
Output is correct |
9 |
Correct |
295 ms |
31356 KB |
Output is correct |
10 |
Correct |
313 ms |
31432 KB |
Output is correct |
11 |
Correct |
69 ms |
13856 KB |
Output is correct |
12 |
Correct |
309 ms |
31468 KB |
Output is correct |
13 |
Correct |
295 ms |
30164 KB |
Output is correct |
14 |
Correct |
267 ms |
26248 KB |
Output is correct |
15 |
Correct |
283 ms |
26212 KB |
Output is correct |
16 |
Correct |
271 ms |
26320 KB |
Output is correct |
17 |
Correct |
267 ms |
26244 KB |
Output is correct |
18 |
Correct |
285 ms |
26460 KB |
Output is correct |
19 |
Correct |
260 ms |
26088 KB |
Output is correct |
20 |
Correct |
261 ms |
26248 KB |
Output is correct |
21 |
Correct |
269 ms |
26140 KB |
Output is correct |
22 |
Correct |
253 ms |
26216 KB |
Output is correct |
23 |
Correct |
60 ms |
13900 KB |
Output is correct |
24 |
Correct |
264 ms |
26544 KB |
Output is correct |
25 |
Correct |
33 ms |
7492 KB |
Output is correct |
26 |
Correct |
2 ms |
4356 KB |
Output is correct |
27 |
Correct |
2 ms |
4352 KB |
Output is correct |
28 |
Correct |
54 ms |
10536 KB |
Output is correct |
29 |
Correct |
25 ms |
8368 KB |
Output is correct |
30 |
Correct |
3 ms |
4436 KB |
Output is correct |
31 |
Correct |
4 ms |
4564 KB |
Output is correct |
32 |
Correct |
5 ms |
4692 KB |
Output is correct |
33 |
Correct |
3 ms |
4436 KB |
Output is correct |
34 |
Correct |
28 ms |
7440 KB |
Output is correct |
35 |
Correct |
2 ms |
4308 KB |
Output is correct |
36 |
Correct |
3 ms |
4348 KB |
Output is correct |
37 |
Correct |
3 ms |
4308 KB |
Output is correct |
38 |
Correct |
3 ms |
4436 KB |
Output is correct |
39 |
Correct |
3 ms |
4488 KB |
Output is correct |
40 |
Correct |
316 ms |
30912 KB |
Output is correct |
41 |
Correct |
398 ms |
31184 KB |
Output is correct |
42 |
Correct |
311 ms |
31268 KB |
Output is correct |
43 |
Correct |
73 ms |
13936 KB |
Output is correct |
44 |
Correct |
100 ms |
14040 KB |
Output is correct |
45 |
Correct |
253 ms |
25104 KB |
Output is correct |
46 |
Correct |
288 ms |
24812 KB |
Output is correct |
47 |
Correct |
321 ms |
26520 KB |
Output is correct |
48 |
Correct |
77 ms |
13388 KB |
Output is correct |
49 |
Correct |
343 ms |
29364 KB |
Output is correct |
50 |
Correct |
291 ms |
25156 KB |
Output is correct |
51 |
Correct |
312 ms |
25004 KB |
Output is correct |