# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
477541 | RambaXGorilla | 악어의 지하 도시 (IOI11_crocodile) | C++17 | 655 ms | 72796 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<cstdio>
#include<climits>
#include<algorithm>
#include<functional>
#include<utility>
#include<vector>
#include<queue>
using namespace std;
typedef pair <int,int> ii;
#define pq priority_queue
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]){
vector <ii> adj[100010];
int dists[100010];
pq <ii, vector <ii>, greater <ii>> least;
bool once[100010] = {};
for(int i = 0;i < M;i++){
adj[R[i][0]].push_back(ii(L[i], R[i][1]));
adj[R[i][1]].push_back(ii(L[i], R[i][0]));
}
fill(dists, dists + 100010, INT_MAX);
for(int i = 0;i < K;i++){
least.push(ii(0, P[i]));
once[P[i]] = true;
}
while(!least.empty()){
int d = least.top().first;
int u = least.top().second;
least.pop();
if(dists[u] != INT_MAX){
continue;
}
if(!once[u]){
once[u] = true;
continue;
}
if(!u){
return d;
}
dists[u] = d;
for(int i = 0;i < adj[u].size();i++){
int e = adj[u][i].first;
int v = adj[u][i].second;
least.push(ii(d + e, v));
}
}
}
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... |