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;
int N, p;
vector<int> H;
void init(int n, vector<int> h) {
N = n, H = h;
for (int i = 0; i < N; i++) {
if ((i == 0 || H[i] > H[i - 1]) && (i == N - 1 || H[i] > H[i + 1])) {
p = i;
}
}
}
int max_towers(int L, int R, int D) {
int l = upper_bound(H.begin(), H.begin() + p, H[p] - D) - H.begin() - 1;
int r = lower_bound(H.begin() + p, H.end(), H[p] - D, [&](int x, int y) {return x > y;}) - H.begin();
return (L <= l && r <= R) ? 2 : 1;
}
# | 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... |