#include "crocodile.h"
#include <bits/stdc++.h>
using namespace std;
inline namespace
{
} // namespace
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[])
{
vector<vector<pair<int, long>>> adj(N);
for (int i = 0; i < M; i++)
adj[R[i][0]].emplace_back(R[i][1], L[i]),
adj[R[i][1]].emplace_back(R[i][0], L[i]);
vector<array<long, 2>> dist(N, {INT_MAX, INT_MAX});
priority_queue<pair<long, int>> pq;
for (int i = 0; i < K; i++)
dist[P[i]] = {0, 0}, pq.emplace(-dist[P[i]][0], P[i]);
vector<bool> done(N, 0);
while (!pq.empty())
{
auto [d, u] = pq.top();
pq.pop();
if (-d != dist[u][1])
continue;
if (done[u])
continue;
done[u] = 1;
for (auto [v, w] : adj[u])
{
long cost = w - d;
if (cost < dist[v][0])
dist[v][1] = dist[v][0],
dist[v][0] = cost;
else if (cost < dist[v][1])
dist[v][1] = cost;
else
continue;
pq.emplace(-dist[v][1], v);
}
}
return dist[0][1];
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
1 ms |
340 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
1 ms |
340 KB |
Output is correct |
8 |
Correct |
1 ms |
340 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
1 ms |
340 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
1 ms |
340 KB |
Output is correct |
8 |
Correct |
1 ms |
340 KB |
Output is correct |
9 |
Correct |
3 ms |
724 KB |
Output is correct |
10 |
Correct |
1 ms |
340 KB |
Output is correct |
11 |
Correct |
1 ms |
468 KB |
Output is correct |
12 |
Correct |
3 ms |
980 KB |
Output is correct |
13 |
Correct |
3 ms |
980 KB |
Output is correct |
14 |
Correct |
1 ms |
340 KB |
Output is correct |
15 |
Correct |
2 ms |
340 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
1 ms |
340 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
1 ms |
340 KB |
Output is correct |
8 |
Correct |
1 ms |
340 KB |
Output is correct |
9 |
Correct |
3 ms |
724 KB |
Output is correct |
10 |
Correct |
1 ms |
340 KB |
Output is correct |
11 |
Correct |
1 ms |
468 KB |
Output is correct |
12 |
Correct |
3 ms |
980 KB |
Output is correct |
13 |
Correct |
3 ms |
980 KB |
Output is correct |
14 |
Correct |
1 ms |
340 KB |
Output is correct |
15 |
Correct |
2 ms |
340 KB |
Output is correct |
16 |
Correct |
410 ms |
67468 KB |
Output is correct |
17 |
Correct |
84 ms |
16540 KB |
Output is correct |
18 |
Correct |
108 ms |
18864 KB |
Output is correct |
19 |
Correct |
549 ms |
77036 KB |
Output is correct |
20 |
Correct |
260 ms |
52816 KB |
Output is correct |
21 |
Correct |
38 ms |
7220 KB |
Output is correct |
22 |
Correct |
275 ms |
48744 KB |
Output is correct |