#include "crocodile.h"
#include <bits/stdc++.h>
#define mp make_pair
#define pb emplace_back
#define fi first
#define se second
using namespace std;
vector<pair<int, int>> conn[100005];
int dist[100005];
int travel_plan(int n, int m, int r[][2], int l[], int k, int p[]){
for(int i = 0; i < n; i++) dist[i] = -1;
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<>> dij;
for(int i = 0; i < k; i++) {
dist[p[i]] = 0;
dij.push(mp(0, p[i]));
}
for(int i = 0; i < m; i++) {
conn[r[i][0]].pb(mp(r[i][1], l[i]));
conn[r[i][1]].pb(mp(r[i][0], l[i]));
}
while(!dij.empty()) {
pair<int, int> now = dij.top();
dij.pop();
if(dist[now.se] > 0 && dist[now.se] <= now.fi) continue;
if(dist[now.se] == -1) {
dist[now.se] = -2;
continue;
}
dist[now.se] = now.fi;
for(auto x: conn[now.se]) {
if(dist[x.fi] < 0 || dist[x.fi] > now.fi + x.se) {
dij.push(mp(x.se + now.fi, x.fi));
}
}
}
return dist[0];
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
2644 KB |
Output is correct |
2 |
Correct |
2 ms |
2648 KB |
Output is correct |
3 |
Correct |
2 ms |
2656 KB |
Output is correct |
4 |
Correct |
2 ms |
2644 KB |
Output is correct |
5 |
Correct |
2 ms |
2644 KB |
Output is correct |
6 |
Correct |
2 ms |
2644 KB |
Output is correct |
7 |
Correct |
2 ms |
2644 KB |
Output is correct |
8 |
Correct |
2 ms |
2644 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
2644 KB |
Output is correct |
2 |
Correct |
2 ms |
2648 KB |
Output is correct |
3 |
Correct |
2 ms |
2656 KB |
Output is correct |
4 |
Correct |
2 ms |
2644 KB |
Output is correct |
5 |
Correct |
2 ms |
2644 KB |
Output is correct |
6 |
Correct |
2 ms |
2644 KB |
Output is correct |
7 |
Correct |
2 ms |
2644 KB |
Output is correct |
8 |
Correct |
2 ms |
2644 KB |
Output is correct |
9 |
Correct |
4 ms |
3028 KB |
Output is correct |
10 |
Correct |
2 ms |
2644 KB |
Output is correct |
11 |
Correct |
3 ms |
2808 KB |
Output is correct |
12 |
Correct |
6 ms |
3284 KB |
Output is correct |
13 |
Correct |
6 ms |
3412 KB |
Output is correct |
14 |
Correct |
2 ms |
2668 KB |
Output is correct |
15 |
Correct |
3 ms |
2772 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
2644 KB |
Output is correct |
2 |
Correct |
2 ms |
2648 KB |
Output is correct |
3 |
Correct |
2 ms |
2656 KB |
Output is correct |
4 |
Correct |
2 ms |
2644 KB |
Output is correct |
5 |
Correct |
2 ms |
2644 KB |
Output is correct |
6 |
Correct |
2 ms |
2644 KB |
Output is correct |
7 |
Correct |
2 ms |
2644 KB |
Output is correct |
8 |
Correct |
2 ms |
2644 KB |
Output is correct |
9 |
Correct |
4 ms |
3028 KB |
Output is correct |
10 |
Correct |
2 ms |
2644 KB |
Output is correct |
11 |
Correct |
3 ms |
2808 KB |
Output is correct |
12 |
Correct |
6 ms |
3284 KB |
Output is correct |
13 |
Correct |
6 ms |
3412 KB |
Output is correct |
14 |
Correct |
2 ms |
2668 KB |
Output is correct |
15 |
Correct |
3 ms |
2772 KB |
Output is correct |
16 |
Correct |
565 ms |
64268 KB |
Output is correct |
17 |
Correct |
72 ms |
13260 KB |
Output is correct |
18 |
Correct |
90 ms |
14860 KB |
Output is correct |
19 |
Correct |
637 ms |
66932 KB |
Output is correct |
20 |
Correct |
419 ms |
57872 KB |
Output is correct |
21 |
Correct |
39 ms |
7500 KB |
Output is correct |
22 |
Correct |
396 ms |
46124 KB |
Output is correct |