#include "jumps.h"
//OP
#include<bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define pi pair<int, int >
#define pq priority_queue
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define eb emplace_back
#define mset multiset
#define F first
#define S second
#define meta int M = (L + R) / 2, x = 2 * id + 1, y = x + 1
using namespace std;
bool one;
struct tree {
int n;
int lj[200005];
int rj[200005];
int jump[200005][20];
int jump2[200005][20];
vector<int> h;
pi t[800005];
void build(int id, int L, int R) {
if (L == R) {t[id] = {h[L], L}; return ;}
meta;
build(x, L, M);
build(y, M + 1, R);
t[id] = max(t[x], t[y]);
} void build() {build(0, 0, n-1); return ;}
pi query(int id, int L, int R, int l, int r) {
if (R < l || r < L) return {-2e9, -1};
if (l <= L && r >= R) return t[id];
meta;
return max(query(x, L, M, l, r), query(y, M + 1, R, l, r));
} pi query(int L, int R) {return query(0, 0, n-1, L, R);}
void take_jump(vector<int> H) {
stack<int> st;
for (int i = 0; i < n; i++) {
while (!st.empty() && H[st.top()] < H[i]) st.pop();
if (st.empty()) lj[i] = -1;
else lj[i] = st.top();
st.push(i);
}
while (!st.empty()) st.pop();
for (int i = n-1; i >= 0; i--) {
while (!st.empty() && H[st.top()] < H[i]) st.pop();
if (st.empty()) rj[i] = n;
else rj[i] = st.top();
st.push(i);
}
}
void set_jump() {
for (int i = 0; i < n; i++) {
int mx = lj[i], mx2 = rj[i];
if (mx == -1) mx = n;
if (h[mx] < h[mx2]) swap(mx, mx2);
jump[i][0] = mx;
jump2[i][0] = mx2;
}
jump[n][0] = jump2[n][0] = n;
for (int j = 1; j < 20; j++)
for (int i = 0; i <= n; i++)
jump[i][j] = jump[jump[i][j-1]][j-1];
for (int j = 1; j < 20; j++)
for (int i = 0; i <= n; i++)
jump2[i][j] = jump2[jump2[i][j-1]][j-1];
}
int count(int A, int B, int C, int D) {
vector<int> mindis(n, 2e9);
pq<pi> q;
for (int i = A; i <= B; i++) {mindis[i] = 0;q.push({0, i});}
while(!q.empty()) {
int i = q.top().F, s = q.top().S; q.pop();
if (mindis[s] != i) continue;
if (s >= C && s <= D) return i;
if (lj[s] >= 0 && mindis[lj[s]] > i + 1) {
mindis[lj[s]] = i + 1;
q.push({i + 1, lj[s]});
}
if (rj[s] < n && mindis[rj[s]] > i + 1) {
mindis[rj[s]] = i + 1;
q.push({i + 1, rj[s]});
}
}
return -1;
}
int count(int A, int B, int C) {
A = query(max(A, lj[C] + 1), min(B, rj[C] - 1)).S;
if (A == -1) return -1;
int ans = 0;
for (int i = 19; i >= 0; i--)
if (h[jump[A][i]] < h[C]) {A = jump[A][i]; ans += (1 << i);}
if (jump[A][0] == C) return ans + 1;
for (int i = 19; i >= 0; i--)
if (h[jump2[A][i]] < h[C]) {A = jump2[A][i]; ans += (1 << i);}
if (jump2[A][0] == C) return ans + 1;
return -1;
}
} T;
void init(int N, std::vector<int> H) {
T.n = N; T.h = H;
T.take_jump(H);
T.build();
T.h.pb(N + 1);
T.set_jump();
one = 1;
for (int i = 0; i < N; i++) if (H[i] != i+1) {one = 0; break;}
}
int minimum_jumps(int A, int B, int C, int D) {
if (C == D) return T.count(A, B, C);
if (one) return C-B;
return T.count(A, B, C, D);
}
//ED
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
12632 KB |
Output is correct |
2 |
Correct |
2 ms |
12632 KB |
Output is correct |
3 |
Correct |
93 ms |
39528 KB |
Output is correct |
4 |
Correct |
579 ms |
41988 KB |
Output is correct |
5 |
Correct |
518 ms |
30512 KB |
Output is correct |
6 |
Correct |
656 ms |
42092 KB |
Output is correct |
7 |
Correct |
454 ms |
35304 KB |
Output is correct |
8 |
Correct |
604 ms |
42076 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
12632 KB |
Output is correct |
2 |
Correct |
2 ms |
12632 KB |
Output is correct |
3 |
Correct |
2 ms |
12632 KB |
Output is correct |
4 |
Correct |
2 ms |
12632 KB |
Output is correct |
5 |
Incorrect |
2 ms |
12632 KB |
Output isn't correct |
6 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
12632 KB |
Output is correct |
2 |
Correct |
2 ms |
12632 KB |
Output is correct |
3 |
Correct |
2 ms |
12632 KB |
Output is correct |
4 |
Correct |
2 ms |
12632 KB |
Output is correct |
5 |
Incorrect |
2 ms |
12632 KB |
Output isn't correct |
6 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
12632 KB |
Output is correct |
2 |
Correct |
2 ms |
12632 KB |
Output is correct |
3 |
Correct |
2 ms |
12832 KB |
Output is correct |
4 |
Correct |
2 ms |
12708 KB |
Output is correct |
5 |
Incorrect |
51 ms |
40908 KB |
Output isn't correct |
6 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
12888 KB |
Output is correct |
2 |
Correct |
2 ms |
12632 KB |
Output is correct |
3 |
Correct |
2 ms |
12632 KB |
Output is correct |
4 |
Correct |
155 ms |
28344 KB |
Output is correct |
5 |
Correct |
625 ms |
41888 KB |
Output is correct |
6 |
Correct |
419 ms |
17204 KB |
Output is correct |
7 |
Correct |
616 ms |
41896 KB |
Output is correct |
8 |
Correct |
365 ms |
23864 KB |
Output is correct |
9 |
Correct |
575 ms |
41876 KB |
Output is correct |
10 |
Correct |
772 ms |
41976 KB |
Output is correct |
11 |
Correct |
759 ms |
42044 KB |
Output is correct |
12 |
Correct |
689 ms |
41836 KB |
Output is correct |
13 |
Correct |
630 ms |
41916 KB |
Output is correct |
14 |
Correct |
704 ms |
42288 KB |
Output is correct |
15 |
Correct |
595 ms |
42660 KB |
Output is correct |
16 |
Correct |
623 ms |
42660 KB |
Output is correct |
17 |
Correct |
2 ms |
12632 KB |
Output is correct |
18 |
Correct |
2 ms |
12632 KB |
Output is correct |
19 |
Correct |
2 ms |
12632 KB |
Output is correct |
20 |
Correct |
2 ms |
12632 KB |
Output is correct |
21 |
Correct |
2 ms |
12632 KB |
Output is correct |
22 |
Correct |
2 ms |
12664 KB |
Output is correct |
23 |
Correct |
2 ms |
12884 KB |
Output is correct |
24 |
Correct |
3 ms |
12632 KB |
Output is correct |
25 |
Correct |
2 ms |
12632 KB |
Output is correct |
26 |
Correct |
2 ms |
12632 KB |
Output is correct |
27 |
Correct |
10 ms |
12632 KB |
Output is correct |
28 |
Correct |
14 ms |
12632 KB |
Output is correct |
29 |
Correct |
14 ms |
12888 KB |
Output is correct |
30 |
Correct |
9 ms |
12632 KB |
Output is correct |
31 |
Correct |
10 ms |
12632 KB |
Output is correct |
32 |
Correct |
2 ms |
12632 KB |
Output is correct |
33 |
Correct |
25 ms |
32508 KB |
Output is correct |
34 |
Correct |
56 ms |
41864 KB |
Output is correct |
35 |
Correct |
52 ms |
42044 KB |
Output is correct |
36 |
Correct |
63 ms |
42136 KB |
Output is correct |
37 |
Correct |
58 ms |
42280 KB |
Output is correct |
38 |
Correct |
52 ms |
42664 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
12888 KB |
Output is correct |
2 |
Correct |
2 ms |
12632 KB |
Output is correct |
3 |
Correct |
2 ms |
12632 KB |
Output is correct |
4 |
Correct |
155 ms |
28344 KB |
Output is correct |
5 |
Correct |
625 ms |
41888 KB |
Output is correct |
6 |
Correct |
419 ms |
17204 KB |
Output is correct |
7 |
Correct |
616 ms |
41896 KB |
Output is correct |
8 |
Correct |
365 ms |
23864 KB |
Output is correct |
9 |
Correct |
575 ms |
41876 KB |
Output is correct |
10 |
Correct |
772 ms |
41976 KB |
Output is correct |
11 |
Correct |
759 ms |
42044 KB |
Output is correct |
12 |
Correct |
689 ms |
41836 KB |
Output is correct |
13 |
Correct |
630 ms |
41916 KB |
Output is correct |
14 |
Correct |
704 ms |
42288 KB |
Output is correct |
15 |
Correct |
595 ms |
42660 KB |
Output is correct |
16 |
Correct |
623 ms |
42660 KB |
Output is correct |
17 |
Correct |
2 ms |
12632 KB |
Output is correct |
18 |
Correct |
2 ms |
12632 KB |
Output is correct |
19 |
Correct |
2 ms |
12632 KB |
Output is correct |
20 |
Correct |
2 ms |
12632 KB |
Output is correct |
21 |
Correct |
2 ms |
12632 KB |
Output is correct |
22 |
Correct |
2 ms |
12664 KB |
Output is correct |
23 |
Correct |
2 ms |
12884 KB |
Output is correct |
24 |
Correct |
3 ms |
12632 KB |
Output is correct |
25 |
Correct |
2 ms |
12632 KB |
Output is correct |
26 |
Correct |
2 ms |
12632 KB |
Output is correct |
27 |
Correct |
10 ms |
12632 KB |
Output is correct |
28 |
Correct |
14 ms |
12632 KB |
Output is correct |
29 |
Correct |
14 ms |
12888 KB |
Output is correct |
30 |
Correct |
9 ms |
12632 KB |
Output is correct |
31 |
Correct |
10 ms |
12632 KB |
Output is correct |
32 |
Correct |
2 ms |
12632 KB |
Output is correct |
33 |
Correct |
25 ms |
32508 KB |
Output is correct |
34 |
Correct |
56 ms |
41864 KB |
Output is correct |
35 |
Correct |
52 ms |
42044 KB |
Output is correct |
36 |
Correct |
63 ms |
42136 KB |
Output is correct |
37 |
Correct |
58 ms |
42280 KB |
Output is correct |
38 |
Correct |
52 ms |
42664 KB |
Output is correct |
39 |
Correct |
2 ms |
12632 KB |
Output is correct |
40 |
Correct |
2 ms |
12632 KB |
Output is correct |
41 |
Correct |
2 ms |
12632 KB |
Output is correct |
42 |
Correct |
126 ms |
28244 KB |
Output is correct |
43 |
Correct |
623 ms |
41876 KB |
Output is correct |
44 |
Correct |
390 ms |
17232 KB |
Output is correct |
45 |
Correct |
613 ms |
41908 KB |
Output is correct |
46 |
Correct |
364 ms |
23988 KB |
Output is correct |
47 |
Correct |
579 ms |
41772 KB |
Output is correct |
48 |
Correct |
783 ms |
42064 KB |
Output is correct |
49 |
Correct |
694 ms |
42080 KB |
Output is correct |
50 |
Correct |
723 ms |
41848 KB |
Output is correct |
51 |
Correct |
632 ms |
41848 KB |
Output is correct |
52 |
Correct |
710 ms |
42092 KB |
Output is correct |
53 |
Correct |
656 ms |
42748 KB |
Output is correct |
54 |
Correct |
629 ms |
42668 KB |
Output is correct |
55 |
Correct |
2 ms |
12632 KB |
Output is correct |
56 |
Correct |
89 ms |
41840 KB |
Output is correct |
57 |
Correct |
618 ms |
41884 KB |
Output is correct |
58 |
Correct |
282 ms |
19264 KB |
Output is correct |
59 |
Correct |
596 ms |
41868 KB |
Output is correct |
60 |
Correct |
244 ms |
26024 KB |
Output is correct |
61 |
Correct |
557 ms |
41900 KB |
Output is correct |
62 |
Correct |
715 ms |
41992 KB |
Output is correct |
63 |
Correct |
705 ms |
41948 KB |
Output is correct |
64 |
Correct |
749 ms |
42004 KB |
Output is correct |
65 |
Correct |
557 ms |
42076 KB |
Output is correct |
66 |
Correct |
724 ms |
42100 KB |
Output is correct |
67 |
Correct |
652 ms |
42756 KB |
Output is correct |
68 |
Correct |
586 ms |
42664 KB |
Output is correct |
69 |
Correct |
2 ms |
12632 KB |
Output is correct |
70 |
Correct |
2 ms |
12632 KB |
Output is correct |
71 |
Correct |
3 ms |
12632 KB |
Output is correct |
72 |
Correct |
3 ms |
12736 KB |
Output is correct |
73 |
Correct |
3 ms |
12632 KB |
Output is correct |
74 |
Correct |
3 ms |
12632 KB |
Output is correct |
75 |
Correct |
2 ms |
12632 KB |
Output is correct |
76 |
Correct |
2 ms |
12632 KB |
Output is correct |
77 |
Correct |
2 ms |
12632 KB |
Output is correct |
78 |
Correct |
2 ms |
12632 KB |
Output is correct |
79 |
Correct |
3 ms |
12632 KB |
Output is correct |
80 |
Correct |
3 ms |
12736 KB |
Output is correct |
81 |
Correct |
3 ms |
12632 KB |
Output is correct |
82 |
Correct |
3 ms |
12632 KB |
Output is correct |
83 |
Correct |
2 ms |
12632 KB |
Output is correct |
84 |
Correct |
2 ms |
12632 KB |
Output is correct |
85 |
Correct |
4 ms |
12632 KB |
Output is correct |
86 |
Correct |
9 ms |
12632 KB |
Output is correct |
87 |
Correct |
10 ms |
12632 KB |
Output is correct |
88 |
Correct |
15 ms |
12632 KB |
Output is correct |
89 |
Correct |
10 ms |
12632 KB |
Output is correct |
90 |
Correct |
13 ms |
12632 KB |
Output is correct |
91 |
Correct |
2 ms |
12632 KB |
Output is correct |
92 |
Correct |
2 ms |
12632 KB |
Output is correct |
93 |
Correct |
10 ms |
12632 KB |
Output is correct |
94 |
Correct |
10 ms |
12632 KB |
Output is correct |
95 |
Correct |
10 ms |
12632 KB |
Output is correct |
96 |
Correct |
13 ms |
12632 KB |
Output is correct |
97 |
Correct |
10 ms |
12632 KB |
Output is correct |
98 |
Correct |
2 ms |
12632 KB |
Output is correct |
99 |
Correct |
60 ms |
42144 KB |
Output is correct |
100 |
Correct |
59 ms |
41896 KB |
Output is correct |
101 |
Correct |
52 ms |
41928 KB |
Output is correct |
102 |
Correct |
58 ms |
41704 KB |
Output is correct |
103 |
Correct |
52 ms |
42088 KB |
Output is correct |
104 |
Correct |
54 ms |
42664 KB |
Output is correct |
105 |
Correct |
2 ms |
12632 KB |
Output is correct |
106 |
Correct |
26 ms |
32708 KB |
Output is correct |
107 |
Correct |
57 ms |
41876 KB |
Output is correct |
108 |
Correct |
51 ms |
42040 KB |
Output is correct |
109 |
Correct |
57 ms |
42032 KB |
Output is correct |
110 |
Correct |
56 ms |
42300 KB |
Output is correct |
111 |
Correct |
53 ms |
42648 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
12632 KB |
Output is correct |
2 |
Correct |
2 ms |
12632 KB |
Output is correct |
3 |
Correct |
93 ms |
39528 KB |
Output is correct |
4 |
Correct |
579 ms |
41988 KB |
Output is correct |
5 |
Correct |
518 ms |
30512 KB |
Output is correct |
6 |
Correct |
656 ms |
42092 KB |
Output is correct |
7 |
Correct |
454 ms |
35304 KB |
Output is correct |
8 |
Correct |
604 ms |
42076 KB |
Output is correct |
9 |
Correct |
2 ms |
12632 KB |
Output is correct |
10 |
Correct |
2 ms |
12632 KB |
Output is correct |
11 |
Correct |
2 ms |
12632 KB |
Output is correct |
12 |
Correct |
2 ms |
12632 KB |
Output is correct |
13 |
Incorrect |
2 ms |
12632 KB |
Output isn't correct |
14 |
Halted |
0 ms |
0 KB |
- |