# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
979716 | nnin | Rainforest Jumps (APIO21_jumps) | C++14 | 4014 ms | 45420 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 pii pair<int,int>
using namespace std;
int n, l[200005], r[200005], jump[200005][20], jump2[200005][20];
vector<int> h;
bool one;
struct segTree {
pii seg[4*200005];
void build(int i, int l, int r) {
if(l==r) {
seg[i] = {h[l], l};
return;
}
int m = (l+r)/2;
build(i*2+1, l, m);
build(i*2+2, m+1, r);
seg[i] = max(seg[i*2+1], seg[i*2+2]);
}
pii query(int i, int l, int r, int wl, int wr) {
if(wl>r || wr<l) return {-2e9, -1};
if(wl<=l && wr>=r) return seg[i];
int m = (l+r)/2;
return max(query(i*2+1, l, m, wl, wr), query(i*2+2, m+1, r, wl, wr));
}
}t;
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... |