oj.uz

Submission #490866

# Submission time Handle Problem Language Result Execution time Memory
490866 2021-11-29T14:45:21 Z SeDunion Rainforest Jumps (APIO21_jumps) C++17
48 / 100
 1299 ms 116808 KB 
#include "jumps.h"

#include <vector>
#include <iostream>
#include <math.h>
#include <stack>
#include <cassert>

using namespace std;

const int LOG = 20;

int pl[int(3e5)], pr[int(3e5)];

int high[int(3e5)][LOG], low[int(3e5)][LOG];

int highL[int(3e5)][LOG], lowL[int(3e5)][LOG];
int highR[int(3e5)][LOG], lowR[int(3e5)][LOG];

int H[int(3e5)], id[int(3e5)];

int spmx[int(3e5)][LOG];

int lg[int(3e5)];

int getmax(int l, int r) {
	int j = lg[r - l + 1];
	return max(spmx[l][j], spmx[r - (1 << j) + 1][j]);
}

void init(int N, vector<int> a) {
	for (int &i : a) i--;
	for (int i = 0 ; i < N ; ++ i) H[i] = a[i];
	H[N] = N;
	for (int i = 0 ; i <= N ; ++ i) id[H[i]] = i;
	stack<int>st;
	for (int i = 0 ; i < N ; ++ i) {
		while (st.size() && H[st.top()] < H[i]) st.pop();
		pl[H[i]] = st.size() ? H[st.top()] : N;
		st.push(i);
	}
	while (st.size()) st.pop();
	for (int i = N - 1 ; i >= 0 ; -- i) {
		while (st.size() && H[st.top()] < H[i]) st.pop();
		pr[H[i]] = st.size() ? H[st.top()] : N;
		st.push(i);
	}
	pl[N] = pr[N] = N;
	for (int i = 0 ; i <= N ; ++ i) {
		high[i][0] = max(pl[i], pr[i]);
		highL[i][0] = min(id[i], id[max(pl[i], pr[i])]), highR[i][0] = max(id[i], id[max(pl[i], pr[i])]);
		low[i][0] = pr[i];
		lowL[i][0] = min(id[i], id[pr[i]]), lowR[i][0] = max(id[i], id[pr[i]]);
	}
	for (int j = 1 ; j < LOG ; ++ j) {
		for (int i = 0 ; i <= N ; ++ i) {
			{
				int where = high[i][j - 1];
				high[i][j] = high[where][j - 1];
				highL[i][j] = min(highL[i][j - 1], highL[where][j - 1]);
				highR[i][j] = max(highR[i][j - 1], highR[where][j - 1]);
			}
			{
				int where = low[i][j - 1];
				low[i][j] = low[where][j - 1];
				lowL[i][j] = min(lowL[i][j - 1], lowL[where][j - 1]);
				lowR[i][j] = max(lowR[i][j - 1], lowR[where][j - 1]);
			}
		}
	}
	for (int i = 0 ; i <= N ; ++ i) {
		spmx[i][0] = H[i];
	}
	for (int j = 1 ; j < LOG ; ++ j) {
		for (int i = 0 ; i + (1 << j) - 1 <= N ; ++ i) {
			spmx[i][j] = max(spmx[i][j - 1], spmx[i + (1 << (j - 1))][j - 1]);
		}
	}
	for (int i = 2 ; i < int(3e5) ; ++ i) lg[i] = lg[i >> 1] + 1;
}

int minimum_jumps(int A, int B, int C, int D) {
	int dmx = getmax(C, D);
	int s = -1;
	{
		int l = A, r = B;
		while (l <= r) {
			int m = (l + r) >> 1;
			if (getmax(m, B) <= dmx) s = getmax(m, B), r = m - 1;
			else l = m + 1;
		}
	}
	if (s == -1) return -1;
	int ans = 0;
	for (int i = LOG - 1 ; i >= 0 ; -- i) {
		if (high[s][i] <= dmx && highR[s][i] < C) {
			ans += 1 << i;
			s = high[s][i];
		}
	}
	for (int i = LOG - 1 ; i >= 0 ; -- i) {
		if (low[s][i] <= dmx && lowR[s][i] < C) {
			ans += 1 << i;
			s = low[s][i];
		}
	}
	s = low[s][0], ans++;
	if (id[s] < C || id[s] > D) return -1;
	return ans;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1480 KB Output is correct
2 Correct 1 ms 1480 KB Output is correct
3 Correct 265 ms 93080 KB Output is correct
4 Correct 1266 ms 116808 KB Output is correct
5 Correct 885 ms 59400 KB Output is correct
6 Correct 1299 ms 116640 KB Output is correct
7 Correct 956 ms 80064 KB Output is correct
8 Correct 1155 ms 116544 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1480 KB Output is correct
2 Correct 1 ms 1552 KB Output is correct
3 Correct 1 ms 1480 KB Output is correct
4 Correct 1 ms 1480 KB Output is correct
5 Correct 3 ms 1480 KB Output is correct
6 Incorrect 3 ms 1608 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1480 KB Output is correct
2 Correct 1 ms 1552 KB Output is correct
3 Correct 1 ms 1480 KB Output is correct
4 Correct 1 ms 1480 KB Output is correct
5 Correct 3 ms 1480 KB Output is correct
6 Incorrect 3 ms 1608 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1480 KB Output is correct
2 Correct 1 ms 1480 KB Output is correct
3 Correct 1 ms 1480 KB Output is correct
4 Correct 1 ms 1480 KB Output is correct
5 Correct 195 ms 93452 KB Output is correct
6 Correct 222 ms 115744 KB Output is correct
7 Correct 115 ms 60092 KB Output is correct
8 Correct 275 ms 115760 KB Output is correct
9 Correct 31 ms 18668 KB Output is correct
10 Correct 229 ms 115768 KB Output is correct
11 Correct 220 ms 116528 KB Output is correct
12 Correct 208 ms 116404 KB Output is correct
13 Correct 225 ms 116420 KB Output is correct
14 Correct 231 ms 115732 KB Output is correct
15 Incorrect 274 ms 116132 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1480 KB Output is correct
2 Correct 1 ms 1480 KB Output is correct
3 Correct 1 ms 1480 KB Output is correct
4 Correct 343 ms 53820 KB Output is correct
5 Correct 1037 ms 115816 KB Output is correct
6 Correct 696 ms 20348 KB Output is correct
7 Correct 1141 ms 115780 KB Output is correct
8 Correct 651 ms 40764 KB Output is correct
9 Correct 1096 ms 115776 KB Output is correct
10 Correct 1222 ms 116600 KB Output is correct
11 Correct 1241 ms 116640 KB Output is correct
12 Correct 1166 ms 116484 KB Output is correct
13 Correct 1151 ms 115876 KB Output is correct
14 Correct 811 ms 116108 KB Output is correct
15 Correct 1096 ms 116536 KB Output is correct
16 Correct 1117 ms 116592 KB Output is correct
17 Correct 2 ms 1480 KB Output is correct
18 Correct 1 ms 1480 KB Output is correct
19 Correct 3 ms 1480 KB Output is correct
20 Correct 4 ms 1608 KB Output is correct
21 Correct 3 ms 1608 KB Output is correct
22 Correct 2 ms 1608 KB Output is correct
23 Correct 3 ms 1608 KB Output is correct
24 Correct 4 ms 1608 KB Output is correct
25 Correct 1 ms 1608 KB Output is correct
26 Correct 2 ms 1864 KB Output is correct
27 Correct 18 ms 2632 KB Output is correct
28 Correct 23 ms 2632 KB Output is correct
29 Correct 23 ms 2632 KB Output is correct
30 Correct 24 ms 2632 KB Output is correct
31 Correct 22 ms 2632 KB Output is correct
32 Correct 1 ms 1480 KB Output is correct
33 Correct 127 ms 67620 KB Output is correct
34 Correct 248 ms 115916 KB Output is correct
35 Correct 219 ms 116528 KB Output is correct
36 Correct 224 ms 115772 KB Output is correct
37 Correct 257 ms 116136 KB Output is correct
38 Correct 201 ms 116596 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1480 KB Output is correct
2 Correct 1 ms 1480 KB Output is correct
3 Correct 1 ms 1480 KB Output is correct
4 Correct 343 ms 53820 KB Output is correct
5 Correct 1037 ms 115816 KB Output is correct
6 Correct 696 ms 20348 KB Output is correct
7 Correct 1141 ms 115780 KB Output is correct
8 Correct 651 ms 40764 KB Output is correct
9 Correct 1096 ms 115776 KB Output is correct
10 Correct 1222 ms 116600 KB Output is correct
11 Correct 1241 ms 116640 KB Output is correct
12 Correct 1166 ms 116484 KB Output is correct
13 Correct 1151 ms 115876 KB Output is correct
14 Correct 811 ms 116108 KB Output is correct
15 Correct 1096 ms 116536 KB Output is correct
16 Correct 1117 ms 116592 KB Output is correct
17 Correct 2 ms 1480 KB Output is correct
18 Correct 1 ms 1480 KB Output is correct
19 Correct 3 ms 1480 KB Output is correct
20 Correct 4 ms 1608 KB Output is correct
21 Correct 3 ms 1608 KB Output is correct
22 Correct 2 ms 1608 KB Output is correct
23 Correct 3 ms 1608 KB Output is correct
24 Correct 4 ms 1608 KB Output is correct
25 Correct 1 ms 1608 KB Output is correct
26 Correct 2 ms 1864 KB Output is correct
27 Correct 18 ms 2632 KB Output is correct
28 Correct 23 ms 2632 KB Output is correct
29 Correct 23 ms 2632 KB Output is correct
30 Correct 24 ms 2632 KB Output is correct
31 Correct 22 ms 2632 KB Output is correct
32 Correct 1 ms 1480 KB Output is correct
33 Correct 127 ms 67620 KB Output is correct
34 Correct 248 ms 115916 KB Output is correct
35 Correct 219 ms 116528 KB Output is correct
36 Correct 224 ms 115772 KB Output is correct
37 Correct 257 ms 116136 KB Output is correct
38 Correct 201 ms 116596 KB Output is correct
39 Correct 1 ms 1480 KB Output is correct
40 Correct 1 ms 1480 KB Output is correct
41 Correct 1 ms 1480 KB Output is correct
42 Correct 371 ms 53784 KB Output is correct
43 Correct 1229 ms 115736 KB Output is correct
44 Correct 627 ms 20340 KB Output is correct
45 Correct 1085 ms 115776 KB Output is correct
46 Correct 604 ms 40856 KB Output is correct
47 Correct 1259 ms 115740 KB Output is correct
48 Correct 1036 ms 116724 KB Output is correct
49 Correct 1194 ms 116544 KB Output is correct
50 Correct 1199 ms 116528 KB Output is correct
51 Correct 1180 ms 115764 KB Output is correct
52 Correct 1216 ms 116136 KB Output is correct
53 Correct 1077 ms 116640 KB Output is correct
54 Correct 1168 ms 116688 KB Output is correct
55 Correct 1 ms 1480 KB Output is correct
56 Correct 275 ms 115252 KB Output is correct
57 Correct 1249 ms 116028 KB Output is correct
58 Correct 468 ms 21564 KB Output is correct
59 Correct 1102 ms 115748 KB Output is correct
60 Correct 471 ms 42048 KB Output is correct
61 Correct 1008 ms 115872 KB Output is correct
62 Correct 1088 ms 116644 KB Output is correct
63 Correct 1174 ms 116516 KB Output is correct
64 Correct 1290 ms 116244 KB Output is correct
65 Correct 1207 ms 115744 KB Output is correct
66 Correct 1207 ms 116108 KB Output is correct
67 Correct 1119 ms 116712 KB Output is correct
68 Correct 1116 ms 116644 KB Output is correct
69 Correct 1 ms 1480 KB Output is correct
70 Correct 1 ms 1480 KB Output is correct
71 Correct 4 ms 1608 KB Output is correct
72 Correct 4 ms 1608 KB Output is correct
73 Correct 3 ms 1608 KB Output is correct
74 Correct 3 ms 1608 KB Output is correct
75 Correct 3 ms 1608 KB Output is correct
76 Correct 1 ms 1480 KB Output is correct
77 Correct 1 ms 1480 KB Output is correct
78 Correct 2 ms 1480 KB Output is correct
79 Correct 4 ms 1608 KB Output is correct
80 Correct 3 ms 1608 KB Output is correct
81 Correct 3 ms 1608 KB Output is correct
82 Correct 4 ms 1608 KB Output is correct
83 Correct 4 ms 1608 KB Output is correct
84 Correct 1 ms 1608 KB Output is correct
85 Correct 5 ms 1608 KB Output is correct
86 Correct 24 ms 2632 KB Output is correct
87 Correct 24 ms 2632 KB Output is correct
88 Correct 22 ms 2632 KB Output is correct
89 Correct 22 ms 2632 KB Output is correct
90 Correct 24 ms 2632 KB Output is correct
91 Correct 1 ms 1608 KB Output is correct
92 Correct 2 ms 1864 KB Output is correct
93 Correct 23 ms 2632 KB Output is correct
94 Correct 23 ms 2632 KB Output is correct
95 Correct 23 ms 2632 KB Output is correct
96 Correct 10 ms 2632 KB Output is correct
97 Correct 21 ms 2632 KB Output is correct
98 Correct 1 ms 1480 KB Output is correct
99 Correct 220 ms 115600 KB Output is correct
100 Correct 227 ms 115896 KB Output is correct
101 Correct 206 ms 116384 KB Output is correct
102 Correct 257 ms 115768 KB Output is correct
103 Correct 258 ms 116236 KB Output is correct
104 Correct 198 ms 116644 KB Output is correct
105 Correct 1 ms 1480 KB Output is correct
106 Correct 127 ms 67564 KB Output is correct
107 Correct 240 ms 115764 KB Output is correct
108 Correct 208 ms 116536 KB Output is correct
109 Correct 245 ms 115904 KB Output is correct
110 Correct 254 ms 116184 KB Output is correct
111 Correct 213 ms 116640 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1480 KB Output is correct
2 Correct 1 ms 1480 KB Output is correct
3 Correct 265 ms 93080 KB Output is correct
4 Correct 1266 ms 116808 KB Output is correct
5 Correct 885 ms 59400 KB Output is correct
6 Correct 1299 ms 116640 KB Output is correct
7 Correct 956 ms 80064 KB Output is correct
8 Correct 1155 ms 116544 KB Output is correct
9 Correct 1 ms 1480 KB Output is correct
10 Correct 1 ms 1552 KB Output is correct
11 Correct 1 ms 1480 KB Output is correct
12 Correct 1 ms 1480 KB Output is correct
13 Correct 3 ms 1480 KB Output is correct
14 Incorrect 3 ms 1608 KB Output isn't correct
15 Halted 0 ms 0 KB -