#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 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 J[200005][20];
int J2[200005][20];
vector<int> h;
pi t[800005];
pi g[800005];
void build(int id, int L, int R) {
if (L == R) {t[id] = {h[L], L}; g[id] = {h[L], L}; return ;}
meta;
build(x, L, M);
build(y, M + 1, R);
t[id] = max(t[x], t[y]);
g[id] = min(g[x], g[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);}
pi ub(int id, int L, int R, int i, int k) {
if (t[id].F < k) return {-2e9, -1};
if (L == R) return t[id];
meta;
if (i <= M) return ub(x, L, M, i, k);
if (i < R) {
pi ans = ub(y, M + 1, R, i, k);
if (ans.S != -1) return ans;
return ub(x, L, M, M, k);
}
if (t[y].F > k) return ub(y, M + 1, R, i, k);
return ub(x, L, M, M, k);
} pi ub(int R, int k) {return ub(0, 0, n-1, R, k);}
pi lb(int id, int L, int R, int l, int r, int k) {
if (g[id].F > k) return {-2e9, -1};
if (L == R) return t[id];
meta;
if (r <= M) return lb(x, L, M, l, r, k);
if (l > M) return lb(y, M + 1, R, l, r, k);
if (g[y].F > k) return lb(x, L, M, l, M, k);
if (g[x].F > k) return lb(y, M + 1, R, M + 1, r, k);
return max(lb(x, L, M, l, M, k), lb(y, M + 1, R, M + 1, r, k));
} pi lb(int L, int R, int k) {return lb(0, 0, n-1, L, R, k);}
void take_J(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_J() {
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);
J[i][0] = mx;
J2[i][0] = mx2;
}
J[n][0] = J2[n][0] = n;
for (int j = 1; j < 20; j++)
for (int i = 0; i <= n; i++)
J[i][j] = J[J[i][j-1]][j-1];
for (int j = 1; j < 20; j++)
for (int i = 0; i <= n; i++)
J2[i][j] = J2[J2[i][j-1]][j-1];
}
int count(int A, int C) {
if (A == -1) return -1;
int ans = 0;
for (int i = 19; i >= 0; i--)
if (h[J[A][i]] < h[C]) {A = J[A][i]; ans += (1 << i);}
if (J[A][0] == C) return ans + 1;
for (int i = 19; i >= 0; i--)
if (h[J2[A][i]] < h[C]) {A = J2[A][i]; ans += (1 << i);}
if (J2[A][0] == C) return ans + 1;
return -1;
}
int count(int A, int B, int C) {
if (C > B) return count(query(max(A, lj[C] + 1), B).S, C);
return count(query(A, min(rj[C] - 1, B)).S, C);
}
int count(int A, int B, int C, int D) {
if (B + 1 == C) return (query(C, D).F > h[B] ? 1 : -1);
if (A == 0) {
pi b = query(B + 1, C - 1);
pi c = query(C, D);
pi l = ub(C-1, c.F);
if (b > c) return -1;
if (l.S >= B) return -1;
if (lb(l.S+1, C-1, c.F).S <= B) return 1;
int ans = count(query(l.S+1, B).S, b.S);
return (ans == -1 ? -1 : ans + 1);
}
pi b = query(B + 1, C - 1);
pi c = query(C, D);
pi l = ub(C-1, c.F);
pi a = ub(A-1, b.F);
if (b > c) return -1;
if (l.S >= B) return -1;
if (lb(max(A, l.S+1), C-1, c.F).S <= B) return 1;
int ans = count(query(l.S+1, B).S, b.S);
if (ans != -1) ans++;
if (a.S != -1) {
int x = count(A, B, a.S);
if (x != -1) ans = min(ans, x + 1);
}
return ans;
}
} T;
void init(int N, std::vector<int> H) {
T.n = N; T.h = H;
T.take_J(H);
T.build();
T.h.pb(N + 1);
T.set_J();
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 |
4 ms |
18776 KB |
Output is correct |
2 |
Correct |
3 ms |
18776 KB |
Output is correct |
3 |
Correct |
93 ms |
45800 KB |
Output is correct |
4 |
Correct |
580 ms |
48324 KB |
Output is correct |
5 |
Correct |
538 ms |
36648 KB |
Output is correct |
6 |
Correct |
592 ms |
48268 KB |
Output is correct |
7 |
Correct |
468 ms |
41344 KB |
Output is correct |
8 |
Correct |
605 ms |
48516 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
18776 KB |
Output is correct |
2 |
Correct |
3 ms |
18776 KB |
Output is correct |
3 |
Correct |
3 ms |
18776 KB |
Output is correct |
4 |
Correct |
3 ms |
18776 KB |
Output is correct |
5 |
Incorrect |
3 ms |
18776 KB |
Output isn't correct |
6 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
18776 KB |
Output is correct |
2 |
Correct |
3 ms |
18776 KB |
Output is correct |
3 |
Correct |
3 ms |
18776 KB |
Output is correct |
4 |
Correct |
3 ms |
18776 KB |
Output is correct |
5 |
Incorrect |
3 ms |
18776 KB |
Output isn't correct |
6 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
18776 KB |
Output is correct |
2 |
Correct |
3 ms |
18972 KB |
Output is correct |
3 |
Correct |
3 ms |
18776 KB |
Output is correct |
4 |
Correct |
3 ms |
18776 KB |
Output is correct |
5 |
Correct |
44 ms |
45512 KB |
Output is correct |
6 |
Correct |
55 ms |
48180 KB |
Output is correct |
7 |
Correct |
27 ms |
36656 KB |
Output is correct |
8 |
Correct |
63 ms |
48184 KB |
Output is correct |
9 |
Correct |
9 ms |
23640 KB |
Output is correct |
10 |
Correct |
73 ms |
48412 KB |
Output is correct |
11 |
Correct |
59 ms |
48272 KB |
Output is correct |
12 |
Correct |
62 ms |
48336 KB |
Output is correct |
13 |
Incorrect |
50 ms |
48324 KB |
Output isn't correct |
14 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
18776 KB |
Output is correct |
2 |
Correct |
2 ms |
18776 KB |
Output is correct |
3 |
Correct |
2 ms |
18776 KB |
Output is correct |
4 |
Correct |
166 ms |
34520 KB |
Output is correct |
5 |
Correct |
568 ms |
48176 KB |
Output is correct |
6 |
Correct |
420 ms |
23632 KB |
Output is correct |
7 |
Correct |
605 ms |
48176 KB |
Output is correct |
8 |
Correct |
375 ms |
30000 KB |
Output is correct |
9 |
Correct |
625 ms |
48156 KB |
Output is correct |
10 |
Correct |
789 ms |
48272 KB |
Output is correct |
11 |
Correct |
742 ms |
48076 KB |
Output is correct |
12 |
Correct |
729 ms |
48128 KB |
Output is correct |
13 |
Correct |
609 ms |
48184 KB |
Output is correct |
14 |
Correct |
727 ms |
48368 KB |
Output is correct |
15 |
Correct |
584 ms |
49020 KB |
Output is correct |
16 |
Correct |
598 ms |
49012 KB |
Output is correct |
17 |
Correct |
2 ms |
18776 KB |
Output is correct |
18 |
Correct |
2 ms |
18776 KB |
Output is correct |
19 |
Correct |
3 ms |
18972 KB |
Output is correct |
20 |
Correct |
4 ms |
18776 KB |
Output is correct |
21 |
Correct |
3 ms |
18776 KB |
Output is correct |
22 |
Correct |
3 ms |
18776 KB |
Output is correct |
23 |
Correct |
3 ms |
18776 KB |
Output is correct |
24 |
Correct |
3 ms |
18776 KB |
Output is correct |
25 |
Correct |
2 ms |
18776 KB |
Output is correct |
26 |
Correct |
4 ms |
18936 KB |
Output is correct |
27 |
Correct |
11 ms |
19032 KB |
Output is correct |
28 |
Correct |
14 ms |
19032 KB |
Output is correct |
29 |
Correct |
10 ms |
19032 KB |
Output is correct |
30 |
Correct |
11 ms |
19032 KB |
Output is correct |
31 |
Correct |
10 ms |
19032 KB |
Output is correct |
32 |
Correct |
3 ms |
18776 KB |
Output is correct |
33 |
Correct |
25 ms |
38856 KB |
Output is correct |
34 |
Correct |
55 ms |
48208 KB |
Output is correct |
35 |
Correct |
53 ms |
48376 KB |
Output is correct |
36 |
Correct |
54 ms |
48168 KB |
Output is correct |
37 |
Correct |
50 ms |
48364 KB |
Output is correct |
38 |
Correct |
61 ms |
48952 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
18776 KB |
Output is correct |
2 |
Correct |
2 ms |
18776 KB |
Output is correct |
3 |
Correct |
2 ms |
18776 KB |
Output is correct |
4 |
Correct |
166 ms |
34520 KB |
Output is correct |
5 |
Correct |
568 ms |
48176 KB |
Output is correct |
6 |
Correct |
420 ms |
23632 KB |
Output is correct |
7 |
Correct |
605 ms |
48176 KB |
Output is correct |
8 |
Correct |
375 ms |
30000 KB |
Output is correct |
9 |
Correct |
625 ms |
48156 KB |
Output is correct |
10 |
Correct |
789 ms |
48272 KB |
Output is correct |
11 |
Correct |
742 ms |
48076 KB |
Output is correct |
12 |
Correct |
729 ms |
48128 KB |
Output is correct |
13 |
Correct |
609 ms |
48184 KB |
Output is correct |
14 |
Correct |
727 ms |
48368 KB |
Output is correct |
15 |
Correct |
584 ms |
49020 KB |
Output is correct |
16 |
Correct |
598 ms |
49012 KB |
Output is correct |
17 |
Correct |
2 ms |
18776 KB |
Output is correct |
18 |
Correct |
2 ms |
18776 KB |
Output is correct |
19 |
Correct |
3 ms |
18972 KB |
Output is correct |
20 |
Correct |
4 ms |
18776 KB |
Output is correct |
21 |
Correct |
3 ms |
18776 KB |
Output is correct |
22 |
Correct |
3 ms |
18776 KB |
Output is correct |
23 |
Correct |
3 ms |
18776 KB |
Output is correct |
24 |
Correct |
3 ms |
18776 KB |
Output is correct |
25 |
Correct |
2 ms |
18776 KB |
Output is correct |
26 |
Correct |
4 ms |
18936 KB |
Output is correct |
27 |
Correct |
11 ms |
19032 KB |
Output is correct |
28 |
Correct |
14 ms |
19032 KB |
Output is correct |
29 |
Correct |
10 ms |
19032 KB |
Output is correct |
30 |
Correct |
11 ms |
19032 KB |
Output is correct |
31 |
Correct |
10 ms |
19032 KB |
Output is correct |
32 |
Correct |
3 ms |
18776 KB |
Output is correct |
33 |
Correct |
25 ms |
38856 KB |
Output is correct |
34 |
Correct |
55 ms |
48208 KB |
Output is correct |
35 |
Correct |
53 ms |
48376 KB |
Output is correct |
36 |
Correct |
54 ms |
48168 KB |
Output is correct |
37 |
Correct |
50 ms |
48364 KB |
Output is correct |
38 |
Correct |
61 ms |
48952 KB |
Output is correct |
39 |
Correct |
2 ms |
18776 KB |
Output is correct |
40 |
Correct |
3 ms |
18776 KB |
Output is correct |
41 |
Correct |
3 ms |
18776 KB |
Output is correct |
42 |
Correct |
130 ms |
34440 KB |
Output is correct |
43 |
Correct |
568 ms |
48180 KB |
Output is correct |
44 |
Correct |
389 ms |
23632 KB |
Output is correct |
45 |
Correct |
625 ms |
48176 KB |
Output is correct |
46 |
Correct |
351 ms |
30008 KB |
Output is correct |
47 |
Correct |
608 ms |
48428 KB |
Output is correct |
48 |
Correct |
788 ms |
48332 KB |
Output is correct |
49 |
Correct |
677 ms |
48336 KB |
Output is correct |
50 |
Correct |
743 ms |
48376 KB |
Output is correct |
51 |
Correct |
588 ms |
48188 KB |
Output is correct |
52 |
Correct |
723 ms |
48492 KB |
Output is correct |
53 |
Correct |
616 ms |
48924 KB |
Output is correct |
54 |
Correct |
579 ms |
48948 KB |
Output is correct |
55 |
Correct |
2 ms |
18776 KB |
Output is correct |
56 |
Correct |
76 ms |
47928 KB |
Output is correct |
57 |
Correct |
636 ms |
48180 KB |
Output is correct |
58 |
Correct |
306 ms |
25664 KB |
Output is correct |
59 |
Correct |
632 ms |
48132 KB |
Output is correct |
60 |
Correct |
246 ms |
32320 KB |
Output is correct |
61 |
Correct |
593 ms |
48176 KB |
Output is correct |
62 |
Correct |
722 ms |
48288 KB |
Output is correct |
63 |
Correct |
706 ms |
48332 KB |
Output is correct |
64 |
Correct |
721 ms |
48352 KB |
Output is correct |
65 |
Correct |
584 ms |
48184 KB |
Output is correct |
66 |
Correct |
711 ms |
48372 KB |
Output is correct |
67 |
Correct |
601 ms |
49008 KB |
Output is correct |
68 |
Correct |
610 ms |
49104 KB |
Output is correct |
69 |
Correct |
3 ms |
18776 KB |
Output is correct |
70 |
Correct |
3 ms |
18776 KB |
Output is correct |
71 |
Correct |
3 ms |
18776 KB |
Output is correct |
72 |
Correct |
4 ms |
18776 KB |
Output is correct |
73 |
Correct |
4 ms |
18776 KB |
Output is correct |
74 |
Correct |
4 ms |
18864 KB |
Output is correct |
75 |
Correct |
3 ms |
18776 KB |
Output is correct |
76 |
Correct |
3 ms |
18776 KB |
Output is correct |
77 |
Correct |
2 ms |
18776 KB |
Output is correct |
78 |
Correct |
3 ms |
18776 KB |
Output is correct |
79 |
Correct |
5 ms |
18776 KB |
Output is correct |
80 |
Correct |
4 ms |
18776 KB |
Output is correct |
81 |
Correct |
3 ms |
18776 KB |
Output is correct |
82 |
Correct |
4 ms |
18776 KB |
Output is correct |
83 |
Correct |
3 ms |
18776 KB |
Output is correct |
84 |
Correct |
3 ms |
18776 KB |
Output is correct |
85 |
Correct |
4 ms |
18888 KB |
Output is correct |
86 |
Correct |
14 ms |
19032 KB |
Output is correct |
87 |
Correct |
12 ms |
19032 KB |
Output is correct |
88 |
Correct |
13 ms |
19032 KB |
Output is correct |
89 |
Correct |
14 ms |
19032 KB |
Output is correct |
90 |
Correct |
12 ms |
19032 KB |
Output is correct |
91 |
Correct |
3 ms |
18776 KB |
Output is correct |
92 |
Correct |
3 ms |
18776 KB |
Output is correct |
93 |
Correct |
11 ms |
19032 KB |
Output is correct |
94 |
Correct |
12 ms |
19032 KB |
Output is correct |
95 |
Correct |
16 ms |
19032 KB |
Output is correct |
96 |
Correct |
11 ms |
19032 KB |
Output is correct |
97 |
Correct |
11 ms |
19032 KB |
Output is correct |
98 |
Correct |
2 ms |
18776 KB |
Output is correct |
99 |
Correct |
55 ms |
47928 KB |
Output is correct |
100 |
Correct |
54 ms |
48188 KB |
Output is correct |
101 |
Correct |
51 ms |
48268 KB |
Output is correct |
102 |
Correct |
55 ms |
48184 KB |
Output is correct |
103 |
Correct |
61 ms |
48544 KB |
Output is correct |
104 |
Correct |
47 ms |
49032 KB |
Output is correct |
105 |
Correct |
3 ms |
18776 KB |
Output is correct |
106 |
Correct |
29 ms |
38756 KB |
Output is correct |
107 |
Correct |
58 ms |
48164 KB |
Output is correct |
108 |
Correct |
48 ms |
48140 KB |
Output is correct |
109 |
Correct |
57 ms |
48192 KB |
Output is correct |
110 |
Correct |
52 ms |
48372 KB |
Output is correct |
111 |
Correct |
54 ms |
48916 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
18776 KB |
Output is correct |
2 |
Correct |
3 ms |
18776 KB |
Output is correct |
3 |
Correct |
93 ms |
45800 KB |
Output is correct |
4 |
Correct |
580 ms |
48324 KB |
Output is correct |
5 |
Correct |
538 ms |
36648 KB |
Output is correct |
6 |
Correct |
592 ms |
48268 KB |
Output is correct |
7 |
Correct |
468 ms |
41344 KB |
Output is correct |
8 |
Correct |
605 ms |
48516 KB |
Output is correct |
9 |
Correct |
3 ms |
18776 KB |
Output is correct |
10 |
Correct |
3 ms |
18776 KB |
Output is correct |
11 |
Correct |
3 ms |
18776 KB |
Output is correct |
12 |
Correct |
3 ms |
18776 KB |
Output is correct |
13 |
Incorrect |
3 ms |
18776 KB |
Output isn't correct |
14 |
Halted |
0 ms |
0 KB |
- |