# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1051875 | kachim2 | Rainforest Jumps (APIO21_jumps) | C++17 | 0 ms | 344 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 <vector>
#include<iostream>
using namespace std;
std::vector<int> H;
vector<int> next;
vector<int> prev;
void init(int N, std::vector<int> nH) {
H = nH;
}
int minimum_jumps(int A, int B, int C, int D) {
return B-A;
int mcd = 0;
for(int i = C; i <=D; i++){
mcd = max(mcd, H[i]);
}
int bs = 0;
for(int i = B; i >= A; i--){
//cerr << H[i] << ' ';
if(H[i]<mcd) bs = max(bs, i);
else break;
}
//cerr << bs << '\n';
int cm = H[bs], cnt = 0;
for(int i = bs; i <= D; i++){
if(H[i]>cm) {
# | 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... |