# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1052647 | kachim2 | Rainforest Jumps (APIO21_jumps) | C++17 | 907 ms | 49996 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 "stub.cpp"
#include<queue>
#include<array>
#include <vector>
#include <iostream>
using namespace std;
std::vector<int> H;
vector<int> nxt;
vector<int> prv;
vector<int> d;
array<pair<int, int>, 1<<20> segtree;
vector<array<int, 25>> jp;
vector<array<int, 25>> njp;
bool subtask1=1;
pair<int, int> mquery(int a, int b){
a--;
b++;
a+=(segtree.size()/2)+1;
b+=(segtree.size()/2)+1;
pair<int, int> res = {0, 0};
while(b-a > 1){
if(a%2 == 0){
res = max(segtree[a+1], res);
}
if(b%2 == 1){
res = max(segtree[b-1], res);
}
a/=2;
b/=2;
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... |