#include "jumps.h"
#include<bits/stdc++.h>
using namespace std;
int n, dp[200005];
vector<int> h;
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 ans = INT_MAX;
for(int i = s + 1; i < n; i++){
if(h[i] > h[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;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
1112 KB |
Output is correct |
2 |
Correct |
1 ms |
1112 KB |
Output is correct |
3 |
Execution timed out |
4074 ms |
12552 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
1112 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
1112 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
1112 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
1364 KB |
Output is correct |
2 |
Correct |
1 ms |
1112 KB |
Output is correct |
3 |
Correct |
1 ms |
1112 KB |
Output is correct |
4 |
Incorrect |
2318 ms |
1896 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
1364 KB |
Output is correct |
2 |
Correct |
1 ms |
1112 KB |
Output is correct |
3 |
Correct |
1 ms |
1112 KB |
Output is correct |
4 |
Incorrect |
2318 ms |
1896 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
1112 KB |
Output is correct |
2 |
Correct |
1 ms |
1112 KB |
Output is correct |
3 |
Execution timed out |
4074 ms |
12552 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |