# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
795812 | GusterGoose27 | Rainforest Jumps (APIO21_jumps) | C++17 | 1187 ms | 40360 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;
const int MAXN = 2e5+5;
const int MAXB = 20;
typedef pair<int, int> pii;
int height[MAXN];
int great[MAXN][2];
int nxt[MAXN][MAXB];
int depth[MAXN];
int n;
int get_max(int i, int j) { // returns rightmost in case
if (i == -1) return j;
if (j == -1) return i;
return height[i] > height[j] ? i : j;
}
class stree {
public:
int lp, rp;
stree *l = nullptr;
stree *r = nullptr;
int mx = 0;
stree(int lv, int rv) {
lp = lv;
rp = rv;
# | 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... |