# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
702222 | dykw | Radio Towers (IOI22_towers) | C++17 | 1004 ms | 35604 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;
constexpr int MaxN = 100000;
constexpr int LogN = 16;
constexpr int Inf = 1E9;
namespace RMQ {
int st[LogN + 1][MaxN];
void build(vector<int> &H) {
int N = H.size();
for (int i = 0; i < N; ++i) {
st[0][i] = H[i];
}
for (int i = 1; (1 << i) <= N; ++i) {
for (int j = 0; j + (1 << i) - 1 < N; ++j) {
st[i][j] = max(st[i - 1][j], st[i - 1][j + (1 << (i - 1))]);
}
}
}
int ask(int l, int r) {
if (l > r) {
return -1;
}
int k = __lg(r - l + 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... |