#include "jumps.h"
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define f first
#define s second
using namespace std;
const int N = 2e5 + 10;
ll bp[N][18];
ll bp2[N][18];
ll z[N], h[N];
ll Le[N], Ri[N];
void init(int n, vector<int> H) {
for(int j = 1; j <= n; j++)
h[j] = H[j - 1];
stack<int> L, R;
for(int j = 1; j <= n; j++)
z[h[j]] = j;
for(int i = 1; i <= n; i++) {
while(L.size() && L.top() <= h[i])L.pop();
if(L.size())
Le[i] = L.top();
L.push(h[i]);
}
for(int i = n; i >= 1; i--) {
while(R.size() && R.top() <= h[i])R.pop();
if(R.size())
Ri[i] = R.top();
R.push(h[i]);
}
for(int j = n; j >= 1; j--) {
bp[z[j]][0] = (Le[z[j]] > Ri[z[j]] ? Le[z[j]] : Ri[z[j]]);
bp2[z[j]][0] = Ri[z[j]];
for(int i = 1; i < 18; i++) {
bp[z[j]][i] = bp[bp[z[j]][i - 1]][i - 1];
bp2[z[j]][i] = bp2[bp2[z[j]][i - 1]][i - 1];
}
}
}
int minimum_jumps(int A, int B, int C, int D) {
A++, B++, C++, D++;
ll cnt = 0;
for(int j = 17; j >= 0; j--) {
if(bp[B][j] == 0)continue;
if(bp[B][j] <= h[C]) {
cnt += (1<<j);
B = z[bp[B][j]];
}
}
for(int j = 17; j >= 0; j--) {
if(bp2[B][j] == 0)continue;
if(bp2[B][j] <= h[C]) {
cnt += (1<<j);
B = z[bp2[B][j]];
}
}
if(B != C)return -1;
return cnt;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
336 KB |
Output is correct |
2 |
Correct |
0 ms |
336 KB |
Output is correct |
3 |
Correct |
175 ms |
50724 KB |
Output is correct |
4 |
Correct |
955 ms |
63672 KB |
Output is correct |
5 |
Correct |
821 ms |
32200 KB |
Output is correct |
6 |
Correct |
967 ms |
63700 KB |
Output is correct |
7 |
Correct |
792 ms |
43592 KB |
Output is correct |
8 |
Correct |
1000 ms |
63684 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
336 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
336 KB |
Output is correct |
2 |
Correct |
0 ms |
336 KB |
Output is correct |
3 |
Correct |
0 ms |
336 KB |
Output is correct |
4 |
Incorrect |
265 ms |
29656 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
336 KB |
Output is correct |
2 |
Correct |
0 ms |
336 KB |
Output is correct |
3 |
Correct |
0 ms |
336 KB |
Output is correct |
4 |
Incorrect |
265 ms |
29656 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
336 KB |
Output is correct |
2 |
Correct |
0 ms |
336 KB |
Output is correct |
3 |
Correct |
175 ms |
50724 KB |
Output is correct |
4 |
Correct |
955 ms |
63672 KB |
Output is correct |
5 |
Correct |
821 ms |
32200 KB |
Output is correct |
6 |
Correct |
967 ms |
63700 KB |
Output is correct |
7 |
Correct |
792 ms |
43592 KB |
Output is correct |
8 |
Correct |
1000 ms |
63684 KB |
Output is correct |
9 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
10 |
Halted |
0 ms |
0 KB |
- |