# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
744963 | RushB | Rainforest Jumps (APIO21_jumps) | C++17 | 1162 ms | 35752 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 "jumps.h"
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
const int N = 2e5 + 5;
const int L = 18;
int prv[N], nxt[N], n, h[N], sparse[N][L], mx[4 * N];
vector<int> H;
int argmax(int x, int y) {
return H[x] > H[y] ? x : y;
}
void build_tree(int v, int l, int r) {
if (l + 1 == r) {
mx[v] = l;
return;
}
int m = l + r >> 1;
build_tree(v << 1, l, m), build_tree(v << 1 | 1, m, r);
mx[v] = argmax(mx[v << 1], mx[v << 1 | 1]);
}
int get_mx(int v, int l, int r, int L, int R) {
if (R <= l || r <= L || R <= L) return n;
if (L <= l && r <= R) return mx[v];
int m = l + r >> 1;
return argmax(get_mx(v << 1, l, m, L, R), get_mx(v << 1 | 1, m, r, L, R));
}
void init(int _n, std::vector<int> _H) {
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... |