# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
969337 | abczz | Road Construction (JOI21_road_construction) | C++14 | 1966 ms | 28448 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 <iostream>
#include <vector>
#include <array>
#include <algorithm>
#include <map>
#define ll long long
using namespace std;
ll n, k, f;
vector <ll> V;
map <pair<ll, ll>, ll> mp;
array <ll, 2> A[250000];
void solve(ll mid, bool b) {
V.clear();
mp.clear();
f = 0;
for (int i=0; i<n; ++i) {
auto it = mp.lower_bound({A[i][0]-A[i][1]-mid, 0});
while (it != mp.end()) {
if (it->first.first > A[i][0]-A[i][1]+mid) break;
auto nx = next(it);
if (it->first.second + mid < A[i][0]+A[i][1]) mp.erase(it);
else {
auto x = (it->first.first+it->first.second)/2;
V.push_back(abs(A[i][0]-x)+abs(A[i][1]-it->first.second+x));
if (b && V.size() > k) break;
}
it = nx;
}
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... |