# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
648441 | Alexandruabcde | Rainforest Jumps (APIO21_jumps) | C++14 | 1488 ms | 45760 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>
using namespace std;
constexpr int LOGMAX = 20;
constexpr int NMAX = 2e5 + 5;
int st[LOGMAX][NMAX];
int dr[LOGMAX][NMAX];
int bst[LOGMAX][NMAX];
int Lg[NMAX];
int vf;
void init(int N, std::vector<int> H) {
deque <int> D;
Lg[1] = 0;
for (int i = 2; i <= N; ++ i )
Lg[i] = Lg[i/2] + 1;
vf = Lg[N];
for (int i = 0; i <= vf; ++ i )
for (int j = 0; j < N; ++ j )
st[i][j] = dr[i][j] = bst[i][j] = -1;
for (int i = 0; i < N; ++ i ) {
while (!D.empty() && H[D.back()] < H[i]) {
dr[0][D.back()] = i;
# | 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... |