#define wiwihorz
#include "jumps.h"
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma loop-opt(on)
#define rep(i, a, b) for(int i = a; i <= b; i++)
#define rrep(i, a, b) for(int i = b; i >= a; i--)
#define ceil(a, b) ((a + b - 1) / (b))
#define all(x) x.begin(), x.end()
#define MOD 1000000007
#define eps (1e-9)
#define INF 1000000000
using namespace std;
#define lld long double
#define pii pair<int, int>
#define random mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count())
#ifdef wiwihorz
#define print(a...) kout("[" + string(#a) + "] = ", a)
void vprint(auto L, auto R) {while(L < R) cerr << *L << " \n"[next(L) == R], ++L; }
void kout() {cerr << endl; }
template<class T1, class ... T2> void kout(T1 a, T2 ... e) { cerr << a << " ", kout(e...);}
#else
#define print(...) 0
#define vprint(...) 0
#endif
int n, lg;
vector<int> L, R, h;
vector<vector<int>> l, r;
vector<vector<pii>> sp;
int query(int L, int R) {
if(L > R) return -1;
int cur = 31 - __builtin_clz(R - L + 1);
pii ans = max(sp[cur][L], sp[cur][R - (1 << cur) + 1]);
return ans.second;
}
void init(int N, vector<int> H) {
n = N, lg = 32 - __builtin_clz(n);
set<int> s; vector<int> a(n, 0);
L.assign(n + 2, 0);
R.assign(n + 2, 0);
h.assign(n + 2, 0);
h[0] = h[n + 1] = INF;
rep(i, 0, n - 1) h[i + 1] = H[i];
rep(i, 1, n) a[i - 1] = i;
sort(all(a), [](int x, int y) { return h[x] > h[y]; });
s.insert(n + 1), s.insert(0);
for(auto i : a) {
auto it = s.lower_bound(i);
int x = *it, y = *prev(it);
if(h[x] < h[y]) swap(x, y);
R[i] = x, L[i] = y;
s.insert(i);
}
l.assign(lg + 1, vector<int>(n + 2, 0));
r.assign(lg + 1, vector<int>(n + 2, 0));
sp.assign(lg + 1, vector<pii>(n + 2, {0, 0}));
L[0] = R[0] = 0, L[n + 1] = R[n + 1] = n + 1;
rep(i, 0, n + 1) {
sp[0][i] = {h[i], i};
l[0][i] = L[i];
r[0][i] = R[i];
}
rep(i, 1, lg) rep(j, 0, n + 1) {
sp[i][j] = max(sp[i - 1][j], sp[i - 1][j + (1 << (i - 1))]);
l[i][j] = l[i - 1][l[i - 1][j]];
r[i][j] = r[i - 1][r[i - 1][j]];
}
return;
}
/*
7 3
3 2 1 6 4 5 7
4 4 6 6
1 3 5 6
0 1 2 2
*/
int minimum_jumps(int A, int B, int C, int D) {
A ++ ,B ++ , C ++, D ++;
int st, ll = A - 1, rr = B + 1, ans = 0;
while(rr - ll > 1) {
int mid = (ll + rr) / 2;
int x = query(mid, B);
if(h[C] < h[x]) ll = mid;
else rr = mid;
}
st = query(rr, B);
if(C != D || st == -1) return -1;
rrep(i, 0, lg) if(h[r[i][st]] <= h[C]) {
st = r[i][st], ans += (1 << i);
}
rrep(i, 0, lg) if(h[l[i][st]] <= h[C]) {
st = l[i][st], ans += (1 << i);
}
if(st == C) return ans;
return -1;
}
Compilation message
jumps.cpp:5: warning: ignoring '#pragma loop ' [-Wunknown-pragmas]
5 | #pragma loop-opt(on)
|
jumps.cpp:23:13: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
23 | void vprint(auto L, auto R) {while(L < R) cerr << *L << " \n"[next(L) == R], ++L; }
| ^~~~
jumps.cpp:23:21: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
23 | void vprint(auto L, auto R) {while(L < R) cerr << *L << " \n"[next(L) == R], ++L; }
| ^~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
200 KB |
Output is correct |
2 |
Correct |
1 ms |
200 KB |
Output is correct |
3 |
Incorrect |
270 ms |
60760 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
200 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
200 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
200 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
200 KB |
Output is correct |
2 |
Correct |
1 ms |
200 KB |
Output is correct |
3 |
Correct |
1 ms |
200 KB |
Output is correct |
4 |
Correct |
357 ms |
33560 KB |
Output is correct |
5 |
Correct |
1319 ms |
76272 KB |
Output is correct |
6 |
Correct |
485 ms |
11844 KB |
Output is correct |
7 |
Correct |
1521 ms |
76352 KB |
Output is correct |
8 |
Correct |
681 ms |
25380 KB |
Output is correct |
9 |
Correct |
1746 ms |
76256 KB |
Output is correct |
10 |
Correct |
1652 ms |
76336 KB |
Output is correct |
11 |
Correct |
1486 ms |
76268 KB |
Output is correct |
12 |
Correct |
1925 ms |
76240 KB |
Output is correct |
13 |
Correct |
1729 ms |
76244 KB |
Output is correct |
14 |
Correct |
2024 ms |
76300 KB |
Output is correct |
15 |
Correct |
1310 ms |
76256 KB |
Output is correct |
16 |
Correct |
1419 ms |
76276 KB |
Output is correct |
17 |
Correct |
1 ms |
200 KB |
Output is correct |
18 |
Correct |
1 ms |
200 KB |
Output is correct |
19 |
Correct |
2 ms |
200 KB |
Output is correct |
20 |
Correct |
3 ms |
328 KB |
Output is correct |
21 |
Correct |
5 ms |
200 KB |
Output is correct |
22 |
Correct |
5 ms |
328 KB |
Output is correct |
23 |
Correct |
4 ms |
328 KB |
Output is correct |
24 |
Correct |
3 ms |
200 KB |
Output is correct |
25 |
Correct |
1 ms |
328 KB |
Output is correct |
26 |
Correct |
2 ms |
476 KB |
Output is correct |
27 |
Correct |
33 ms |
832 KB |
Output is correct |
28 |
Correct |
30 ms |
712 KB |
Output is correct |
29 |
Correct |
24 ms |
712 KB |
Output is correct |
30 |
Correct |
19 ms |
712 KB |
Output is correct |
31 |
Correct |
30 ms |
712 KB |
Output is correct |
32 |
Correct |
0 ms |
200 KB |
Output is correct |
33 |
Correct |
141 ms |
42656 KB |
Output is correct |
34 |
Correct |
343 ms |
76268 KB |
Output is correct |
35 |
Correct |
162 ms |
76292 KB |
Output is correct |
36 |
Correct |
246 ms |
76300 KB |
Output is correct |
37 |
Correct |
205 ms |
76272 KB |
Output is correct |
38 |
Correct |
178 ms |
76208 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
200 KB |
Output is correct |
2 |
Correct |
1 ms |
200 KB |
Output is correct |
3 |
Correct |
1 ms |
200 KB |
Output is correct |
4 |
Correct |
357 ms |
33560 KB |
Output is correct |
5 |
Correct |
1319 ms |
76272 KB |
Output is correct |
6 |
Correct |
485 ms |
11844 KB |
Output is correct |
7 |
Correct |
1521 ms |
76352 KB |
Output is correct |
8 |
Correct |
681 ms |
25380 KB |
Output is correct |
9 |
Correct |
1746 ms |
76256 KB |
Output is correct |
10 |
Correct |
1652 ms |
76336 KB |
Output is correct |
11 |
Correct |
1486 ms |
76268 KB |
Output is correct |
12 |
Correct |
1925 ms |
76240 KB |
Output is correct |
13 |
Correct |
1729 ms |
76244 KB |
Output is correct |
14 |
Correct |
2024 ms |
76300 KB |
Output is correct |
15 |
Correct |
1310 ms |
76256 KB |
Output is correct |
16 |
Correct |
1419 ms |
76276 KB |
Output is correct |
17 |
Correct |
1 ms |
200 KB |
Output is correct |
18 |
Correct |
1 ms |
200 KB |
Output is correct |
19 |
Correct |
2 ms |
200 KB |
Output is correct |
20 |
Correct |
3 ms |
328 KB |
Output is correct |
21 |
Correct |
5 ms |
200 KB |
Output is correct |
22 |
Correct |
5 ms |
328 KB |
Output is correct |
23 |
Correct |
4 ms |
328 KB |
Output is correct |
24 |
Correct |
3 ms |
200 KB |
Output is correct |
25 |
Correct |
1 ms |
328 KB |
Output is correct |
26 |
Correct |
2 ms |
476 KB |
Output is correct |
27 |
Correct |
33 ms |
832 KB |
Output is correct |
28 |
Correct |
30 ms |
712 KB |
Output is correct |
29 |
Correct |
24 ms |
712 KB |
Output is correct |
30 |
Correct |
19 ms |
712 KB |
Output is correct |
31 |
Correct |
30 ms |
712 KB |
Output is correct |
32 |
Correct |
0 ms |
200 KB |
Output is correct |
33 |
Correct |
141 ms |
42656 KB |
Output is correct |
34 |
Correct |
343 ms |
76268 KB |
Output is correct |
35 |
Correct |
162 ms |
76292 KB |
Output is correct |
36 |
Correct |
246 ms |
76300 KB |
Output is correct |
37 |
Correct |
205 ms |
76272 KB |
Output is correct |
38 |
Correct |
178 ms |
76208 KB |
Output is correct |
39 |
Correct |
1 ms |
200 KB |
Output is correct |
40 |
Correct |
1 ms |
200 KB |
Output is correct |
41 |
Correct |
1 ms |
200 KB |
Output is correct |
42 |
Correct |
410 ms |
33624 KB |
Output is correct |
43 |
Correct |
1364 ms |
76320 KB |
Output is correct |
44 |
Correct |
852 ms |
11828 KB |
Output is correct |
45 |
Correct |
1446 ms |
76300 KB |
Output is correct |
46 |
Correct |
653 ms |
25392 KB |
Output is correct |
47 |
Correct |
1408 ms |
76288 KB |
Output is correct |
48 |
Correct |
1239 ms |
76304 KB |
Output is correct |
49 |
Correct |
1578 ms |
76292 KB |
Output is correct |
50 |
Correct |
1711 ms |
76288 KB |
Output is correct |
51 |
Correct |
1698 ms |
76292 KB |
Output is correct |
52 |
Correct |
1386 ms |
76208 KB |
Output is correct |
53 |
Correct |
1249 ms |
76288 KB |
Output is correct |
54 |
Correct |
1271 ms |
76188 KB |
Output is correct |
55 |
Correct |
1 ms |
200 KB |
Output is correct |
56 |
Correct |
379 ms |
75956 KB |
Output is correct |
57 |
Correct |
1661 ms |
76292 KB |
Output is correct |
58 |
Correct |
717 ms |
12596 KB |
Output is correct |
59 |
Correct |
1934 ms |
76308 KB |
Output is correct |
60 |
Correct |
753 ms |
26104 KB |
Output is correct |
61 |
Correct |
1590 ms |
76288 KB |
Output is correct |
62 |
Correct |
1754 ms |
76216 KB |
Output is correct |
63 |
Correct |
1482 ms |
76312 KB |
Output is correct |
64 |
Correct |
1493 ms |
76176 KB |
Output is correct |
65 |
Correct |
1577 ms |
76208 KB |
Output is correct |
66 |
Correct |
1592 ms |
76336 KB |
Output is correct |
67 |
Correct |
1564 ms |
76208 KB |
Output is correct |
68 |
Correct |
1582 ms |
76336 KB |
Output is correct |
69 |
Correct |
1 ms |
200 KB |
Output is correct |
70 |
Correct |
1 ms |
200 KB |
Output is correct |
71 |
Correct |
3 ms |
328 KB |
Output is correct |
72 |
Correct |
3 ms |
328 KB |
Output is correct |
73 |
Correct |
4 ms |
200 KB |
Output is correct |
74 |
Correct |
2 ms |
328 KB |
Output is correct |
75 |
Correct |
3 ms |
200 KB |
Output is correct |
76 |
Correct |
1 ms |
200 KB |
Output is correct |
77 |
Correct |
1 ms |
200 KB |
Output is correct |
78 |
Correct |
3 ms |
200 KB |
Output is correct |
79 |
Correct |
4 ms |
328 KB |
Output is correct |
80 |
Correct |
3 ms |
328 KB |
Output is correct |
81 |
Correct |
4 ms |
200 KB |
Output is correct |
82 |
Correct |
4 ms |
328 KB |
Output is correct |
83 |
Correct |
2 ms |
328 KB |
Output is correct |
84 |
Correct |
1 ms |
328 KB |
Output is correct |
85 |
Correct |
6 ms |
328 KB |
Output is correct |
86 |
Correct |
15 ms |
808 KB |
Output is correct |
87 |
Correct |
20 ms |
712 KB |
Output is correct |
88 |
Correct |
13 ms |
824 KB |
Output is correct |
89 |
Correct |
24 ms |
712 KB |
Output is correct |
90 |
Correct |
22 ms |
836 KB |
Output is correct |
91 |
Correct |
1 ms |
328 KB |
Output is correct |
92 |
Correct |
2 ms |
456 KB |
Output is correct |
93 |
Correct |
30 ms |
712 KB |
Output is correct |
94 |
Correct |
30 ms |
804 KB |
Output is correct |
95 |
Correct |
20 ms |
712 KB |
Output is correct |
96 |
Correct |
21 ms |
712 KB |
Output is correct |
97 |
Correct |
33 ms |
712 KB |
Output is correct |
98 |
Correct |
1 ms |
200 KB |
Output is correct |
99 |
Correct |
334 ms |
76040 KB |
Output is correct |
100 |
Correct |
284 ms |
76208 KB |
Output is correct |
101 |
Correct |
167 ms |
76288 KB |
Output is correct |
102 |
Correct |
280 ms |
76328 KB |
Output is correct |
103 |
Correct |
219 ms |
76276 KB |
Output is correct |
104 |
Correct |
172 ms |
76192 KB |
Output is correct |
105 |
Correct |
0 ms |
200 KB |
Output is correct |
106 |
Correct |
146 ms |
42504 KB |
Output is correct |
107 |
Correct |
274 ms |
76208 KB |
Output is correct |
108 |
Correct |
193 ms |
76232 KB |
Output is correct |
109 |
Correct |
236 ms |
76212 KB |
Output is correct |
110 |
Correct |
203 ms |
76208 KB |
Output is correct |
111 |
Correct |
175 ms |
76280 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
200 KB |
Output is correct |
2 |
Correct |
1 ms |
200 KB |
Output is correct |
3 |
Incorrect |
270 ms |
60760 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |