# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
931607 | Arp | Rainforest Jumps (APIO21_jumps) | C++17 | 0 ms | 0 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<bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
int ml[N],mr[N];
int best[N];
int arr[N];
const int inf = 1e9;
int MAXN;
bool one = true;
void init(int n,vector<int> a){
for(int i = 1;i<=n;i++){
ml[i] = 0;
mr[i] = n + 1;
arr[i] = a[i - 1];
one &= (arr[i] == i);
}
MAXN = n;
arr[0] = arr[n + 1] = inf;
stack<int> lg;
for(int i = 1;i<=n;i++){
while(lg.size() > 0 && arr[lg.top()] < arr[i]) lg.pop();
if(lg.size() > 0){
ml[i] = lg.top();
}
lg.push(i);
}
stack<int> rg;
for(int i = n;i >= 1;i--){
while(rg.size() > 0 && arr[rg.top()] < arr[i]) rg.pop();
if(rg.size() > 0){
mr[i] = rg.top();
}
rg.push(i);
}
for(int i = 1;i<=n;i++){
best[i] = (arr[ml[i]] > arr[mr[i]] ? ml[i] : mr[i]);
}
}
int minimum_jumps(int a,int b,int c,int d){
a ++,b ++;
c ++,d ++;
// if(one) return c - b;
int m2 = c;
for(int i = c + 1;i <= d;i ++){
if(arr[i] > arr[m2]) m2 = i;
}
int maxi = -1;
int m1 = a;
for(int i = a;i <= b;i++){
if(arr[i] > maxi && arr[i] < arr[m2]){
maxi = arr[i];
m1 = i;
}
}
if(maxi == -1) return -1;
int last = m1;
int ans = 0;
while(best[last] < c && arr[best[last]] < arr[m2] && mr[best[last]] < c){
last = best[last];
ans ++;
}
if(best[last] < c && arr[best[last]] < arr[m2] && mr[last] < c){
last = best[last];
ans ++;
}
while(!(last >= c && last <= d)){
if(arr[last] > arr[m2] || last > d) return -1;
last = mr[last];
ans ++;
}
if(last >= c && last <= d) return ans;
return -1;
}
int main(){
int n;
cin >> n;
vector<int> a(n);
for(int &e : a){
cin >> e;
}
init(n,a);
int q;
cin >> q;
while(q --){
int a,b,c,d;
cin >> a >> b >> c >> d;
cout << minimum_jumps(a,b,c,d) << '\n';
}
return 0;
}