# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
826465 | esomer | Radio Towers (IOI22_towers) | C++17 | 4080 ms | 23032 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>
#include "towers.h"
using namespace std;
int N, spec;
vector<int> H, lw;
vector<vector<pair<int, int>>> mn;
pair<int, int> get_mx(int l, int r){
int k = lw[r - l + 1];
return max(mn[k][r], mn[k][l + (1 << k) - 1]);
}
void init(int n, vector<int> H1) {
N = n;
H = H1;
spec = 0;
bool asc = 1;
for(int i = 1; i < N; i++){
if(spec == -1) break;
if(H[i] > H[i-1]){
if(asc) spec = i;
else spec = -1;
}else{
asc = 0;
}
}
lw.resize(N+1);
mn.assign(20, vector<pair<int, int>>(N));
# | 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... |