# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
438101 | cheeheng | Rainforest Jumps (APIO21_jumps) | C++14 | 1876 ms | 83728 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;
typedef pair<int, int> ii;
int nextGreater[200005][20];
int prevGreater[200005][20];
int indx[200005];
int log2_[200005];
ii val[200005][20];
int best[200005][20];
int A1[200005];
int M;
void init2(){
for(int i = 0; i < M; i ++){
val[i][0] = ii(A1[i], i);
}
for(int k = 1; k < 20; k ++){
for(int i = 0; i <= M-(1<<k); i ++){
val[i][k] = max(val[i][k-1], val[i+(1<<(k-1))][k-1]);
}
}
log2_[1] = 0;
for(int i = 2; i <= M; i ++){
log2_[i] = log2_[i>>1] + 1;
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... |