# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
589732 | Error42 | Road Construction (JOI21_road_construction) | C++17 | 9101 ms | 46616 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 <algorithm>
#include <climits>
#include <iostream>
#include <queue>
#include <set>
#include <map>
using namespace std;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
map<ll, set<ll>> points;
for (int i = 0; i < n; i++) {
ll x, y;
cin >> x >> y;
points[x].insert(y);
}
ll worst_dist = (ll)INT_MAX * 5ll;
priority_queue<ll> best_dists;
for (auto cur_it_x = points.begin(); cur_it_x != points.end(); ++cur_it_x) {
auto cur_x = cur_it_x->first;
const auto& cur_ys = cur_it_x->second;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |