# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
416420 | valerikk | Rainforest Jumps (APIO21_jumps) | C++17 | 1575 ms | 41364 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;
typedef long long ll;
typedef long double ld;
const int N = 2e5 + 7;
const int L = 19;
const int INF = 1e9;
int n;
int h[N];
pair<int, int> t[4 * N];
void tree_build(int v, int l, int r) {
if (r - l == 1) {
t[v] = {h[l], l};
} else {
int mid = (l + r) / 2;
tree_build(2 * v, l, mid);
tree_build(2 * v + 1, mid, r);
t[v] = max(t[2 * v], t[2 * v + 1]);
}
}
pair<int, int> get_max(int v, int l, int r, int a, int b) {
if (l >= b || r <= a) return {-INF, -INF};
if (l >= a && r <= b) return t[v];
int mid = (l + r) / 2;
return max(get_max(2 * v, l, mid, a, b), get_max(2 * v + 1, mid, r, a, b));
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... |