# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
667085 | tatyam | Radio Towers (IOI22_towers) | C++17 | 4019 ms | 12048 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 <bits/stdc++.h>
using namespace std;
template<class T> void chmax(T& a, T b){ if(a < b) a = b; }
int N;
vector<int> H;
vector<pair<int, int>> seg;
void init(int N, vector<int> H) {
::N = N;
::H = H;
seg.resize(N * 2);
for(int i = 0; i < N; i++) seg[N + i] = {H[i], i};
for(int i = N; --i; ){
seg[i] = max(seg[i << 1], seg[i << 1 | 1]);
}
}
int argmax(int L, int R){
L += N;
R += N;
pair<int, int> ans;
while(L < R){
if(L & 1) chmax(ans, seg[L++]);
if(R & 1) chmax(ans, seg[--R]);
L >>= 1; R >>= 1;
}
return ans.second;
}
int max_towers(int L, int R, int D) {
# | 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... |