#include <bits/stdc++.h>
using namespace std;
#define NN 100005
#define oo 1e18
#define fi first
#define se second
typedef pair<long long, long long> ii;
int n, m, k, vs[NN];
long long d1[NN], d2[NN];
vector<int> sr;
vector<ii> adj[NN];
int ditra(){
for (int i = 0; i <= n; i++) d1[i] = d2[i] = oo;
priority_queue<ii, vector<ii>, greater<ii>> q;
for (auto x : sr){
d2[x] = d1[x] = 0;
q.push({0, x});
}
while (!q.empty()){
int u = q.top().se;
int du = d2[u];
q.pop();
if (vs[u]) continue;
vs[u] = 1;
for (auto x : adj[u]){
int v = x.fi;
int dv = x.se;
if (du + dv < d1[v]){
d2[v] = d1[v];
d1[v] = du + dv;
q.push({d2[v], v});
}
else if (du + dv < d2[v]){
d2[v] = du + dv;
q.push({d2[v], v});
}
}
}
return (int) d2[0];
}
int travel_plan(int N, int M , int R[][2], int L[], int k, int p[]){
n = N;
m = M;
for (int i = 0; i < m; i++){
int a = R[i][0], b = R[i][1], c = L[i];
adj[a].push_back({b, c});
adj[b].push_back({a, c});
}
for (int i = 0; i < k; i++){
sr.push_back(p[i]);
}
return ditra();
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
8792 KB |
Output is correct |
| 2 |
Correct |
2 ms |
8796 KB |
Output is correct |
| 3 |
Correct |
2 ms |
8796 KB |
Output is correct |
| 4 |
Correct |
2 ms |
8796 KB |
Output is correct |
| 5 |
Correct |
2 ms |
8796 KB |
Output is correct |
| 6 |
Correct |
2 ms |
8796 KB |
Output is correct |
| 7 |
Correct |
2 ms |
8796 KB |
Output is correct |
| 8 |
Correct |
2 ms |
8796 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
8792 KB |
Output is correct |
| 2 |
Correct |
2 ms |
8796 KB |
Output is correct |
| 3 |
Correct |
2 ms |
8796 KB |
Output is correct |
| 4 |
Correct |
2 ms |
8796 KB |
Output is correct |
| 5 |
Correct |
2 ms |
8796 KB |
Output is correct |
| 6 |
Correct |
2 ms |
8796 KB |
Output is correct |
| 7 |
Correct |
2 ms |
8796 KB |
Output is correct |
| 8 |
Correct |
2 ms |
8796 KB |
Output is correct |
| 9 |
Correct |
3 ms |
9052 KB |
Output is correct |
| 10 |
Correct |
3 ms |
8796 KB |
Output is correct |
| 11 |
Correct |
3 ms |
8792 KB |
Output is correct |
| 12 |
Correct |
5 ms |
9308 KB |
Output is correct |
| 13 |
Correct |
4 ms |
9320 KB |
Output is correct |
| 14 |
Correct |
3 ms |
8796 KB |
Output is correct |
| 15 |
Correct |
2 ms |
8796 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
8792 KB |
Output is correct |
| 2 |
Correct |
2 ms |
8796 KB |
Output is correct |
| 3 |
Correct |
2 ms |
8796 KB |
Output is correct |
| 4 |
Correct |
2 ms |
8796 KB |
Output is correct |
| 5 |
Correct |
2 ms |
8796 KB |
Output is correct |
| 6 |
Correct |
2 ms |
8796 KB |
Output is correct |
| 7 |
Correct |
2 ms |
8796 KB |
Output is correct |
| 8 |
Correct |
2 ms |
8796 KB |
Output is correct |
| 9 |
Correct |
3 ms |
9052 KB |
Output is correct |
| 10 |
Correct |
3 ms |
8796 KB |
Output is correct |
| 11 |
Correct |
3 ms |
8792 KB |
Output is correct |
| 12 |
Correct |
5 ms |
9308 KB |
Output is correct |
| 13 |
Correct |
4 ms |
9320 KB |
Output is correct |
| 14 |
Correct |
3 ms |
8796 KB |
Output is correct |
| 15 |
Correct |
2 ms |
8796 KB |
Output is correct |
| 16 |
Correct |
346 ms |
73508 KB |
Output is correct |
| 17 |
Correct |
70 ms |
18632 KB |
Output is correct |
| 18 |
Correct |
91 ms |
20936 KB |
Output is correct |
| 19 |
Correct |
430 ms |
82088 KB |
Output is correct |
| 20 |
Correct |
229 ms |
59732 KB |
Output is correct |
| 21 |
Correct |
34 ms |
13524 KB |
Output is correct |
| 22 |
Correct |
246 ms |
54032 KB |
Output is correct |
