#include "crocodile.h"
#include <bits/stdc++.h>
using namespace std;
const long long INF = (long long) 1e18;
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]) {
vector< vector< pair<int, long long> > > g(N);
for (int i = 0; i < M; i++) {
g[R[i][0]].push_back({R[i][1], L[i]});
g[R[i][1]].push_back({R[i][0], L[i]});
}
vector<long long> dist1(N, INF), dist2(N, INF);
for (int i = 0; i < K; i++) dist1[P[i]] = dist2[P[i]] = 0;
priority_queue< pair<long long, int>, vector< pair<long long, int> >, greater< pair<long long, int> > > pq;
for (int i = 0; i < K; i++) pq.push({0, P[i]});
while (!pq.empty()) {
int u = pq.top().second;
long long d = pq.top().first; pq.pop();
if (d > dist2[u]) continue;
for (auto& v : g[u]) {
long long prev = dist2[v.first];
if (d + v.second < dist1[v.first]) {
dist2[v.first] = dist1[v.first];
dist1[v.first] = d + v.second;
} else if (d + v.second < dist2[v.first]) {
dist2[v.first] = d + v.second;
}
if (dist2[v.first] != prev) pq.push({dist2[v.first], v.first});
}
}
return dist2[0];
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
Output is correct |
| 2 |
Correct |
0 ms |
364 KB |
Output is correct |
| 3 |
Correct |
1 ms |
364 KB |
Output is correct |
| 4 |
Correct |
1 ms |
512 KB |
Output is correct |
| 5 |
Correct |
1 ms |
492 KB |
Output is correct |
| 6 |
Correct |
0 ms |
364 KB |
Output is correct |
| 7 |
Correct |
1 ms |
492 KB |
Output is correct |
| 8 |
Correct |
1 ms |
492 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
Output is correct |
| 2 |
Correct |
0 ms |
364 KB |
Output is correct |
| 3 |
Correct |
1 ms |
364 KB |
Output is correct |
| 4 |
Correct |
1 ms |
512 KB |
Output is correct |
| 5 |
Correct |
1 ms |
492 KB |
Output is correct |
| 6 |
Correct |
0 ms |
364 KB |
Output is correct |
| 7 |
Correct |
1 ms |
492 KB |
Output is correct |
| 8 |
Correct |
1 ms |
492 KB |
Output is correct |
| 9 |
Correct |
2 ms |
748 KB |
Output is correct |
| 10 |
Correct |
1 ms |
364 KB |
Output is correct |
| 11 |
Correct |
1 ms |
492 KB |
Output is correct |
| 12 |
Correct |
4 ms |
1004 KB |
Output is correct |
| 13 |
Correct |
4 ms |
1004 KB |
Output is correct |
| 14 |
Correct |
1 ms |
364 KB |
Output is correct |
| 15 |
Correct |
1 ms |
512 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
Output is correct |
| 2 |
Correct |
0 ms |
364 KB |
Output is correct |
| 3 |
Correct |
1 ms |
364 KB |
Output is correct |
| 4 |
Correct |
1 ms |
512 KB |
Output is correct |
| 5 |
Correct |
1 ms |
492 KB |
Output is correct |
| 6 |
Correct |
0 ms |
364 KB |
Output is correct |
| 7 |
Correct |
1 ms |
492 KB |
Output is correct |
| 8 |
Correct |
1 ms |
492 KB |
Output is correct |
| 9 |
Correct |
2 ms |
748 KB |
Output is correct |
| 10 |
Correct |
1 ms |
364 KB |
Output is correct |
| 11 |
Correct |
1 ms |
492 KB |
Output is correct |
| 12 |
Correct |
4 ms |
1004 KB |
Output is correct |
| 13 |
Correct |
4 ms |
1004 KB |
Output is correct |
| 14 |
Correct |
1 ms |
364 KB |
Output is correct |
| 15 |
Correct |
1 ms |
512 KB |
Output is correct |
| 16 |
Correct |
507 ms |
65504 KB |
Output is correct |
| 17 |
Correct |
82 ms |
14444 KB |
Output is correct |
| 18 |
Correct |
108 ms |
16748 KB |
Output is correct |
| 19 |
Correct |
696 ms |
73008 KB |
Output is correct |
| 20 |
Correct |
320 ms |
52760 KB |
Output is correct |
| 21 |
Correct |
40 ms |
6764 KB |
Output is correct |
| 22 |
Correct |
338 ms |
48364 KB |
Output is correct |
