# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1002275 | ZeroCool | Crocodile's Underground City (IOI11_crocodile) | C++14 | 377 ms | 68332 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "crocodile.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ar array
const ll INF = 1e17;
int travel_plan(int n, int m, int r[][2], int l[], int k, int p[]){
vector<ar<int, 2> > g[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]});
}
ar<ll, 2> dist[n];
bool vis[n];
for(int i = 0;i < n;i++)dist[i] = {INF, INF}, vis[i] = 0;
priority_queue<ar<ll, 2> > q;
for(int i = 0;i < k;i++){
q.push({0, p[i]});
dist[p[i]] = {0, 0};
}
while(q.size()){
int x = q.top()[1];
q.pop();
if(vis[x])continue;
vis[x] = 1;
for(auto [u, w]: g[x]){
if(dist[u][0] > dist[x][1] + w){
dist[u][1] = dist[u][0];
dist[u][0] = dist[x][1] +w ;
q.push({-dist[u][1], u});
}else if(dist[u][1] > dist[x][1] +w ){
dist[u][1] = dist[x][1] + w;
q.push({-dist[u][1], u});
}
}
}
return dist[0][1];
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |