# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
568248 | Aktan | Rainforest Jumps (APIO21_jumps) | C++14 | 4026 ms | 5040 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>
#ifndef EVAL
#include "stub.cpp"
#endif
using namespace std;
int n;
bool h=0;
vector<int> a;
int b[200005],c[200005];
void init(int N, vector<int> H) {
n=N;
a=H;
for(int i=0;i<n;i++){
if(i){
if(H[i]!=H[i-1]+1){
h=1;
break;
}
}
}
if(h==0){
return;
}
deque<int> s;
for(int i=0;i<n;i++){
while(!s.empty() && a[s.back()]<a[i]){
s.pop_back();
}
if(s.empty()){
# | 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... |