# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
308959 | tengiz05 | Crocodile's Underground City (IOI11_crocodile) | C++17 | 1209 ms | 69112 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;
const int inf = 1e9+7;
const int NN = 2e5+5;
vector<pair<int, int>> edges[NN];
multiset<int> dist[NN];
int travel_plan(int n, int m, int R[][2], int L[], int k, int P[]){
for(int i=0;i<m;i++){
edges[R[i][0]].push_back({R[i][1], L[i]});
edges[R[i][1]].push_back({R[i][0], L[i]});
}
set<pair<int, int>> q;
for(int i=0;i<k;i++){
dist[P[i]].insert(0);
dist[P[i]].insert(0);
q.insert({0, P[i]});
}for(int i=0;i<n;i++){
if(dist[i].empty()){
dist[i].insert(inf);
dist[i].insert(inf);
}
}
while(!q.empty()){
auto pp = *q.begin();q.erase(q.find(pp));
int d = pp.first;
int u = pp.second;
auto dd = dist[u].begin();dd++;
int D = *dd;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |