# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
981162 | Darren0724 | Rainforest Jumps (APIO21_jumps) | C++17 | 9 ms | 31216 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;
int n;
vector<int> v,a,b,pl;
int jump[20][200005];
int jump1[20][200005];
void init(int N, vector<int> H) {
n=N;
v=H;
a.resize(n,-1);
b.resize(n,-1);
pl.resize(n+1);
vector<int> st;
for(int i=0;i<n;i++){
pl[v[i]]=i;
while(st.size()&&v[st.back()]<v[i]){
st.pop_back();
}
a[i]=(st.size()?st.back():-1);
st.push_back(i);
}
st.clear();
for(int i=n-1;i>=0;i--){
while(st.size()&&v[st.back()]<v[i]){
st.pop_back();
}
b[i]=(st.size()?st.back():-1);
st.push_back(i);
}
# | 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... |