# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
625587 | d4xn | Radio Towers (IOI22_towers) | C++17 | 4072 ms | 2240 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 "towers.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define ii pair<int, int>
#define vii vector<ii>
int n;
vi v;
void init(int N, std::vector<int> H) {
n = N;
v.resize(n);
for (int i = 0; i < n; i++) v[i] = H[i];
}
int max_towers(int L, int R, int D) {
int l = L;
int r = R;
int d = D;
vii s(r-l+1);
for (int i = l; i <= r; i++) {
s[i-l] = make_pair(v[i], i);
}
sort(s.begin(), s.end());
vi ok(n, 0);
int ans = 0;
for (int i = 0; i < r-l+1; i++) {
int h = s[i].first;
int idx = s[i].second;
if (ok[idx] == ans) {
ans++;
int mx;
if (idx+1 < n) mx = v[idx+1];
for (int j = idx+2; j <= r; j++) {
if (max(h, v[j]) + d <= mx) ok[j]++;
mx = max(mx, v[j]);
}
if (idx-1 >= 0) mx = v[idx-1];
for (int j = idx-2; j >= l; j--) {
if (max(h, v[j]) + d <= mx) ok[j]++;
mx = max(mx, v[j]);
}
}
}
return ans;
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |