# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
960631 | Trisanu_Das | 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 "jumps.h"
#include<bits/stdc++.h>
using namespace std;
int n, dp[200005];
vector<int> v;
void init(int N, vector<int> H) {
n = N;
for(int i = 0; i < n; i++) h.push_back(H[i]);
}
int solve(int s, int c, int d) {
if(c <= s && s <= d) return 0;
if(dp[s] != -1) return dp[s];
int ret = INT_MAX;
for(int i = s + 1; i < n; i++){
if(j[i] > j[s]){
ans = min(ans, 1 + solve(i, c, d));
break;
}
}
for(int i = s - 1; i >= 0;i--){
if(h[i] > h[s]){
ans = min(ans, 1 + solve(i, c, d));
break;
}
}
return dp[s] = ans;
}
int minimum_jumps(int a, int b, int c, int d) {
memset(dp, -1, sizeof(dp));
int ans = INT_MAX;
for(int i = a; i <= b; i++) ans = min(ans, solve(i, c, d));
if(ans == INT_MAX) ans = -1;
return ans;
}