| # | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 91441 | 2018-12-27T13:21:30 Z | arman_ferdous | Crocodile's Underground City (IOI11_crocodile) | C++17 | 0 ms | 0 KB |
#include "crocodile.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5+10;
const ll INF = 1e15;
int n; ll d[N][2];
vector< pair<int,ll> > g[N];
priority_queue< pair<ll,int>, vector< pair<ll,int> >, greater< pair<ll,int> > > q;
int travel_plan(int N_, int M, int R[][2], ll L[], int K, int P[]) {
n = N_;
for(int i = 0; i < M; i++) {
g[R[i][0]].push_back({R[i][1], L[i]});
g[R[i][1]].push_back({R[i][0], L[i]});
}
for(int i = 0; i < n; i++) d[i][0] = d[i][1] = INF;
for(int i = 0; i < K; i++) {
d[P[i]][0] = d[P[i]][1] = 0;
q.push({0, P[i]});
}
while(!q.empty()) {
auto top = q.top(); q.pop();
int u = top.second; ll cw = top.first;
if(cw > d[u][1]) continue;
for(auto e : g[u]) {
if(cw + e.second <= d[e.first][0]) {
d[e.first][1] = d[e.first][0];
d[e.first][0] = cw + e.second;
q.push({d[e.first][1], e.first});
}
else if(cw + e.second < d[e.first][1]) {
d[e.first][1] = cw + e.second;
q.push({d[e.first][1], e.first});
}
}
} return d[0][1];
}