#include <bits/stdc++.h>
#define f first
#define s second
using namespace std;
const int MAXN = 1e5+10;
vector<pair<int,int>> adj[MAXN];
int travel_plan(int N,int M,int (*R)[2],int *L,int K,int *P){
for(int i = 0;i<M;++i){
int u = R[i][0], v = R[i][1], w = L[i];
adj[u].push_back({v,w}); adj[v].push_back({u,w});
}
priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> pq;
vector<vector<int>> dist(N);
for(int i = 0;i<K;++i){
pq.push({0,P[i]});
dist[P[i]].push_back(0); dist[P[i]].push_back(0);
}
while(!pq.empty()){
int cd = pq.top().f, u = pq.top().s; pq.pop();
if(cd != dist[u][1] && cd != dist[u][0]) continue;
for(auto p : adj[u]){
int v = p.f, w = p.s;
if(dist[v].size() == 0){
dist[v].push_back(dist[u][1]+w);
pq.push({dist[v][0],v});
}
else if(dist[v].size() == 1){
dist[v].push_back(dist[u][1]+w);
if(dist[v][0] > dist[v][1]) swap(dist[v][0],dist[v][1]);
pq.push({dist[v][1],v});
}
else{
if(dist[u][1]+w < dist[v][0]){
dist[v][1] = dist[v][0];
dist[v][0] = dist[u][1]+w;
pq.push({dist[v][1],v});
}
else if(dist[u][1]+w < dist[v][1]){
dist[v][1] = dist[u][1]+w;
pq.push({dist[v][1],v});
}
}
}
}
return dist[0][1];
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
6748 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
6748 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
6748 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
