#include <bits/stdc++.h>
#include <crocodile.h>
#define ll int
#define pb push_back
#define mp make_pair
#define s second
#define f first
using namespace std;
#define pii pair<int,int>
const int INF = INT_MAX;
int travel_plan(int n,int m,int r[][2],int l[],int k,int p[]){
vector<pii> adj[n];
for(int i =0;i<m;i++){
int u = r[i][0];
int v = r[i][1];
int d = l[i];
adj[u].push_back(make_pair(v,d));
adj[v].push_back(make_pair(u,d));
}
pii dis[n];
int actual[n];
for(int i =0;i<n;i++) dis[i] = mp(INF,INF),actual[i]=INF;
priority_queue<pii,vector<pii>,greater<pii>> pq;
for(int i =0;i<k;i++){
ll u = p[i];
pq.push(mp(0,u));
dis[u].f = 0;
dis[u].s = 0;
actual[u] = 0;
}
vector<bool> vis(n,false);
while(!pq.empty()){
pii u = pq.top();
pq.pop();
if(vis[u.s]) continue;
vis[u.s]=true;
// cout << u.s << endl;
// cout << "NODES : ";
for(auto v:adj[u.s]){
int Dist = actual[u.s] + v.s;
int V = v.f;
// cout << V << ' ';
if(Dist <= dis[V].f){
dis[V].s = dis[V].f;
dis[V].f = Dist;
actual[V] = dis[V].f;
pq.push(mp(actual[V],V));
}
else if(Dist < dis[V].s){
dis[V].s = Dist;
actual[V] = Dist;
pq.push(mp(Dist,V));
}
}
// cout << endl;
}
return dis[0].s;
}
// int main(){
// int n,m,k;
// cin >> n >> m >> k;
// int give[m][2];
// int l[m];
// int p[k];
// for(int i =0;i<m;i++){
// cin >> give[i][0] >> give[i][1];
// }
// for(int i =0;i<m;i++) cin >> l[i];
// for(int i =0;i<k;i++) cin >> p[i];
// cout << travel_plan(n,m,give,l,k,p) << endl;
// }
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
376 KB |
Output is correct |
| 2 |
Incorrect |
5 ms |
376 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
376 KB |
Output is correct |
| 2 |
Incorrect |
5 ms |
376 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
376 KB |
Output is correct |
| 2 |
Incorrect |
5 ms |
376 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
