oj.uz

Submission #490813

# Submission time Handle Problem Language Result Execution time Memory
490813 2021-11-29T10:30:59 Z SeDunion Rainforest Jumps (APIO21_jumps) C++17
44 / 100
 1260 ms 83980 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 H[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;
	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]);
		low[i][0] = pr[i];
		//low[i][0] = min(pl[i], 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];
			}
			{
				int where = low[i][j - 1];
				low[i][j] = low[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) {
	assert(C == D);
	int t = H[C];
	int s = -1;
	{
		int l = A, r = B;
		while (l <= r) {
			int m = (l + r) >> 1;
			if (getmax(m, B) <= t) 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] <= t) {
			ans += 1 << i;
			s = high[s][i];
		}
	}
	for (int i = LOG - 1 ; i >= 0 ; -- i) {
		if (low[s][i] <= t) {
			ans += 1 << i;
			s = low[s][i];
		}
	}
	if (s != t) return -1;
	return ans;
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1480 KB Output is correct
2 Correct 2 ms 1480 KB Output is correct
3 Runtime error 116 ms 83980 KB Execution killed with signal 6
4 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Runtime error 4 ms 2888 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 4 ms 2888 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Runtime error 5 ms 2908 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.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 284 ms 24744 KB Output is correct
5 Correct 970 ms 52356 KB Output is correct
6 Correct 608 ms 9900 KB Output is correct
7 Correct 903 ms 52344 KB Output is correct
8 Correct 690 ms 19000 KB Output is correct
9 Correct 1132 ms 52364 KB Output is correct
10 Correct 925 ms 53144 KB Output is correct
11 Correct 908 ms 53056 KB Output is correct
12 Correct 1201 ms 53068 KB Output is correct
13 Correct 957 ms 52368 KB Output is correct
14 Correct 950 ms 52684 KB Output is correct
15 Correct 889 ms 53192 KB Output is correct
16 Correct 917 ms 53144 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 3 ms 1480 KB Output is correct
21 Correct 5 ms 1480 KB Output is correct
22 Correct 3 ms 1480 KB Output is correct
23 Correct 3 ms 1480 KB Output is correct
24 Correct 3 ms 1480 KB Output is correct
25 Correct 1 ms 1480 KB Output is correct
26 Correct 2 ms 1608 KB Output is correct
27 Correct 17 ms 1992 KB Output is correct
28 Correct 21 ms 1992 KB Output is correct
29 Correct 23 ms 1992 KB Output is correct
30 Correct 17 ms 1992 KB Output is correct
31 Correct 22 ms 1992 KB Output is correct
32 Correct 1 ms 1480 KB Output is correct
33 Correct 69 ms 30820 KB Output is correct
34 Correct 141 ms 52380 KB Output is correct
35 Correct 104 ms 53024 KB Output is correct
36 Correct 114 ms 52276 KB Output is correct
37 Correct 119 ms 52840 KB Output is correct
38 Correct 128 ms 53152 KB Output is correct

Subtask #6
21.0 / 21.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 284 ms 24744 KB Output is correct
5 Correct 970 ms 52356 KB Output is correct
6 Correct 608 ms 9900 KB Output is correct
7 Correct 903 ms 52344 KB Output is correct
8 Correct 690 ms 19000 KB Output is correct
9 Correct 1132 ms 52364 KB Output is correct
10 Correct 925 ms 53144 KB Output is correct
11 Correct 908 ms 53056 KB Output is correct
12 Correct 1201 ms 53068 KB Output is correct
13 Correct 957 ms 52368 KB Output is correct
14 Correct 950 ms 52684 KB Output is correct
15 Correct 889 ms 53192 KB Output is correct
16 Correct 917 ms 53144 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 3 ms 1480 KB Output is correct
21 Correct 5 ms 1480 KB Output is correct
22 Correct 3 ms 1480 KB Output is correct
23 Correct 3 ms 1480 KB Output is correct
24 Correct 3 ms 1480 KB Output is correct
25 Correct 1 ms 1480 KB Output is correct
26 Correct 2 ms 1608 KB Output is correct
27 Correct 17 ms 1992 KB Output is correct
28 Correct 21 ms 1992 KB Output is correct
29 Correct 23 ms 1992 KB Output is correct
30 Correct 17 ms 1992 KB Output is correct
31 Correct 22 ms 1992 KB Output is correct
32 Correct 1 ms 1480 KB Output is correct
33 Correct 69 ms 30820 KB Output is correct
34 Correct 141 ms 52380 KB Output is correct
35 Correct 104 ms 53024 KB Output is correct
36 Correct 114 ms 52276 KB Output is correct
37 Correct 119 ms 52840 KB Output is correct
38 Correct 128 ms 53152 KB Output is correct
39 Correct 1 ms 1428 KB Output is correct
40 Correct 2 ms 1480 KB Output is correct
41 Correct 1 ms 1480 KB Output is correct
42 Correct 279 ms 24640 KB Output is correct
43 Correct 1059 ms 52272 KB Output is correct
44 Correct 682 ms 9800 KB Output is correct
45 Correct 1090 ms 52288 KB Output is correct
46 Correct 622 ms 19004 KB Output is correct
47 Correct 1197 ms 52380 KB Output is correct
48 Correct 1260 ms 53188 KB Output is correct
49 Correct 1135 ms 53056 KB Output is correct
50 Correct 1131 ms 53056 KB Output is correct
51 Correct 1136 ms 52364 KB Output is correct
52 Correct 1128 ms 52684 KB Output is correct
53 Correct 896 ms 53188 KB Output is correct
54 Correct 1034 ms 53148 KB Output is correct
55 Correct 1 ms 1480 KB Output is correct
56 Correct 164 ms 52124 KB Output is correct
57 Correct 1036 ms 52360 KB Output is correct
58 Correct 562 ms 10432 KB Output is correct
59 Correct 1111 ms 52376 KB Output is correct
60 Correct 383 ms 19520 KB Output is correct
61 Correct 1184 ms 52380 KB Output is correct
62 Correct 1018 ms 53188 KB Output is correct
63 Correct 1035 ms 52892 KB Output is correct
64 Correct 1039 ms 52928 KB Output is correct
65 Correct 1095 ms 52416 KB Output is correct
66 Correct 1145 ms 52708 KB Output is correct
67 Correct 1197 ms 53152 KB Output is correct
68 Correct 1006 ms 53188 KB Output is correct
69 Correct 1 ms 1480 KB Output is correct
70 Correct 3 ms 1480 KB Output is correct
71 Correct 5 ms 1480 KB Output is correct
72 Correct 4 ms 1480 KB Output is correct
73 Correct 4 ms 1468 KB Output is correct
74 Correct 4 ms 1480 KB Output is correct
75 Correct 3 ms 1480 KB Output is correct
76 Correct 1 ms 1480 KB Output is correct
77 Correct 2 ms 1480 KB Output is correct
78 Correct 3 ms 1480 KB Output is correct
79 Correct 6 ms 1480 KB Output is correct
80 Correct 4 ms 1480 KB Output is correct
81 Correct 4 ms 1480 KB Output is correct
82 Correct 4 ms 1480 KB Output is correct
83 Correct 3 ms 1480 KB Output is correct
84 Correct 2 ms 1480 KB Output is correct
85 Correct 5 ms 1480 KB Output is correct
86 Correct 11 ms 1992 KB Output is correct
87 Correct 30 ms 1992 KB Output is correct
88 Correct 26 ms 1992 KB Output is correct
89 Correct 30 ms 1992 KB Output is correct
90 Correct 29 ms 1992 KB Output is correct
91 Correct 2 ms 1480 KB Output is correct
92 Correct 3 ms 1608 KB Output is correct
93 Correct 12 ms 1992 KB Output is correct
94 Correct 24 ms 1992 KB Output is correct
95 Correct 25 ms 1992 KB Output is correct
96 Correct 29 ms 1992 KB Output is correct
97 Correct 20 ms 1992 KB Output is correct
98 Correct 2 ms 1480 KB Output is correct
99 Correct 146 ms 52256 KB Output is correct
100 Correct 142 ms 52320 KB Output is correct
101 Correct 134 ms 52948 KB Output is correct
102 Correct 141 ms 52320 KB Output is correct
103 Correct 132 ms 52684 KB Output is correct
104 Correct 141 ms 53152 KB Output is correct
105 Correct 1 ms 1480 KB Output is correct
106 Correct 97 ms 30932 KB Output is correct
107 Correct 121 ms 52368 KB Output is correct
108 Correct 111 ms 53012 KB Output is correct
109 Correct 144 ms 52400 KB Output is correct
110 Correct 126 ms 52712 KB Output is correct
111 Correct 111 ms 53148 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 2 ms 1480 KB Output is correct
3 Runtime error 116 ms 83980 KB Execution killed with signal 6
4 Halted 0 ms 0 KB -