| # | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 207582 | 2020-03-08T04:58:38 Z | aloo123 | Crocodile's Underground City (IOI11_crocodile) | C++14 | 0 ms | 0 KB |
#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(u,d));
adj[v].push_back(make_pair(v,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;
for(auto v:adj[u.s]){
int Dist = actual[u] + v.s;
int V = v.f;
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;
}
}
}
return dis[0].s;
}