# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
599722 | Meloric | Crocodile's Underground City (IOI11_crocodile) | C++14 | 2084 ms | 212 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>
#define pb push_back
//#define int int64_t
#define pii pair<int, int>
#define X first
#define Y second
#define all(x) (x).begin(),(x).end()
#define lb lower_bound
#define ub upper_bound
using namespace std;
int travel_plan(int n, int m, int R[][2], int L[], int k, int P[]){
vector<vector<pii>> g(n, vector<pii>());
for(int i = 0; i< m; i++){
int c = R[i][0];
int d = R[i][1];
int w = L[i];
g[c].pb({d, w});
g[d].pb({c, w});
}
vector<int>v1(n,-1), v2(n,-1);
priority_queue<pii> pq;
for(int i = 0; i< k; i++){
int c = P[i];
v1[i] = 0;
pq.push({0, c});
}
while(pq.size()){
auto [u, d] = pq.top(); d = -d;
if(v2[u] != -1)continue;
if(v1[u] == -1){
v1[u] = d;
continue;
}
v2[u] = d;
for(auto [v, w] : g[u])pq.push({-(w+d), v});
}
return v2[0];
}
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... |