oj.uz

Submission #977904

# Submission time Handle Problem Language Result Execution time Memory
977904 2024-05-08T13:32:36 Z rshohruh Rainforest Jumps (APIO21_jumps) C++17
44 / 100
 4000 ms 52948 KB 
#include "jumps.h"

#include <vector>
#include <bits/stdc++.h>
using namespace std;
int inf = 1e9;
int n, l;
vector<int> h;
vector<pair<int, int>> a;
vector<vector<int>> up, A;
void init(int N, std::vector<int> H)
{
	cin.tie(nullptr)->sync_with_stdio(false);
	n = N+1;
	h = H;
	l = ceil(log2(n));

	h.push_back(n);
	a.resize(n);
	up.resize(n, vector<int>(l+1));
	A.resize(n, vector<int>(l+1));

	stack<int> st;
	for(int i = 0; i < n; ++i){
		while(!st.empty() && h[st.top()] < h[i]){
			a[st.top()].second = i;
			st.pop();
		}
		st.push(i);
	}
	while(!st.empty()){
		a[st.top()].second = st.top();
		st.pop();
	}

	for(int i = n-1; i >= 0; --i){
		while(!st.empty() && h[st.top()] < h[i]){
			a[st.top()].first = i;
			st.pop();
		}
		st.push(i);
	}
	while(!st.empty()){
		a[st.top()].first = st.top();
		st.pop();
	}

	vector<int> inv_h(n+1);
	for(int i = 0; i < n; ++i) inv_h[h[i]] = i;
	for(int i = n; i > 0; --i){
		int id = inv_h[i];

		if(h[a[id].first] > h[a[id].second]) up[id][0] = a[id].first;
		else up[id][0] = a[id].second;
		
		A[id][0] = a[id].second;

		// cerr << id << ' ' << up[id][0] << ' ';
		for(int j = 1; j <= l; ++j){
			up[id][j] = up[up[id][j-1]][j-1];
			A[id][j] = A[A[id][j-1]][j-1];
			// cerr << up[id][j] << ' ';
		}
		// cerr << endl;
		// cout << a[id].first << ' ' << id << ' ' << a[id].second << endl;
	}

}

int ans(int L, int R){
	int ans = 0;
	for(int i = l; i >= 0; --i){
		if(h[up[L][i]] <= h[R]){
			L = up[L][i];
			ans += (1<<i);
		}
	}
	for(int i = l; i >= 0; --i){
		if(h[A[L][i]] <= h[R]){
			L = A[L][i];
			ans += (1<<i);
		}
	}
	if(L == R) return ans;
	return inf;
}

int minimum_jumps(int A, int B, int C, int D)
{
	// return 0;
	int res = inf;
	for(int id = C; id <= D; ++id){
		int mx = 0, mx_id = B;
		for(int i = B; i >= A; --i){
			if(h[i] > h[id]) break;
			if(h[i] > mx){
				mx = h[i];
				mx_id = i;
			}
		}
		res = min(res, ans(mx_id, id));
	}
	return (res == inf ? -1 : res);
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Execution timed out 4064 ms 41992 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 504 KB Output is correct
5 Correct 2 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 3 ms 344 KB Output is correct
12 Correct 2 ms 344 KB Output is correct
13 Correct 2 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 2 ms 344 KB Output is correct
16 Correct 2 ms 344 KB Output is correct
17 Correct 2 ms 504 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 596 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 2 ms 344 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 2 ms 504 KB Output is correct
32 Correct 1 ms 504 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 1 ms 344 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 0 ms 344 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 504 KB Output is correct
5 Correct 2 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 3 ms 344 KB Output is correct
12 Correct 2 ms 344 KB Output is correct
13 Correct 2 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 2 ms 344 KB Output is correct
16 Correct 2 ms 344 KB Output is correct
17 Correct 2 ms 504 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 596 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 2 ms 344 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 2 ms 504 KB Output is correct
32 Correct 1 ms 504 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 1 ms 344 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 0 ms 344 KB Output is correct
40 Correct 1 ms 516 KB Output is correct
41 Correct 1 ms 344 KB Output is correct
42 Correct 1 ms 344 KB Output is correct
43 Correct 2 ms 352 KB Output is correct
44 Correct 1 ms 344 KB Output is correct
45 Correct 2 ms 344 KB Output is correct
46 Correct 1 ms 344 KB Output is correct
47 Correct 2 ms 344 KB Output is correct
48 Correct 1 ms 344 KB Output is correct
49 Correct 2 ms 344 KB Output is correct
50 Correct 2 ms 504 KB Output is correct
51 Correct 2 ms 344 KB Output is correct
52 Correct 2 ms 528 KB Output is correct
53 Correct 2 ms 344 KB Output is correct
54 Correct 2 ms 344 KB Output is correct
55 Correct 1 ms 344 KB Output is correct
56 Correct 1 ms 344 KB Output is correct
57 Correct 1 ms 344 KB Output is correct
58 Correct 20 ms 600 KB Output is correct
59 Correct 33 ms 600 KB Output is correct
60 Correct 10 ms 600 KB Output is correct
61 Correct 29 ms 600 KB Output is correct
62 Correct 10 ms 592 KB Output is correct
63 Correct 27 ms 600 KB Output is correct
64 Correct 184 ms 856 KB Output is correct
65 Correct 166 ms 856 KB Output is correct
66 Correct 163 ms 600 KB Output is correct
67 Correct 31 ms 756 KB Output is correct
68 Correct 115 ms 600 KB Output is correct
69 Correct 31 ms 856 KB Output is correct
70 Correct 74 ms 600 KB Output is correct
71 Correct 1 ms 344 KB Output is correct
72 Correct 1 ms 344 KB Output is correct
73 Correct 1 ms 340 KB Output is correct
74 Correct 1 ms 596 KB Output is correct
75 Correct 1 ms 344 KB Output is correct
76 Correct 1 ms 344 KB Output is correct
77 Correct 1 ms 344 KB Output is correct
78 Correct 0 ms 344 KB Output is correct
79 Correct 1 ms 344 KB Output is correct
80 Correct 1 ms 344 KB Output is correct
81 Correct 2 ms 344 KB Output is correct
82 Correct 2 ms 344 KB Output is correct
83 Correct 1 ms 344 KB Output is correct
84 Correct 1 ms 344 KB Output is correct
85 Correct 2 ms 344 KB Output is correct
86 Correct 1 ms 512 KB Output is correct
87 Correct 0 ms 344 KB Output is correct
88 Correct 0 ms 344 KB Output is correct
89 Correct 1 ms 344 KB Output is correct
90 Correct 0 ms 344 KB Output is correct
91 Correct 0 ms 344 KB Output is correct
92 Correct 0 ms 344 KB Output is correct
93 Correct 0 ms 344 KB Output is correct
94 Correct 2 ms 344 KB Output is correct
95 Correct 9 ms 600 KB Output is correct
96 Correct 13 ms 760 KB Output is correct
97 Correct 14 ms 760 KB Output is correct
98 Correct 9 ms 856 KB Output is correct
99 Correct 12 ms 1028 KB Output is correct
100 Correct 1 ms 344 KB Output is correct
101 Correct 1 ms 600 KB Output is correct
102 Correct 8 ms 600 KB Output is correct
103 Correct 10 ms 600 KB Output is correct
104 Correct 14 ms 596 KB Output is correct
105 Correct 8 ms 600 KB Output is correct
106 Correct 8 ms 856 KB Output is correct
107 Correct 1 ms 344 KB Output is correct
108 Correct 1 ms 600 KB Output is correct
109 Correct 2 ms 600 KB Output is correct
110 Correct 1 ms 1108 KB Output is correct
111 Correct 2 ms 600 KB Output is correct
112 Correct 1 ms 600 KB Output is correct
113 Correct 1 ms 856 KB Output is correct

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 141 ms 42016 KB Output is correct
6 Correct 193 ms 52100 KB Output is correct
7 Correct 65 ms 23644 KB Output is correct
8 Correct 197 ms 51892 KB Output is correct
9 Correct 14 ms 7316 KB Output is correct
10 Correct 186 ms 51872 KB Output is correct
11 Execution timed out 4001 ms 52920 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 198 ms 20972 KB Output is correct
5 Correct 904 ms 51944 KB Output is correct
6 Correct 424 ms 7892 KB Output is correct
7 Correct 719 ms 51876 KB Output is correct
8 Correct 387 ms 16112 KB Output is correct
9 Correct 785 ms 52120 KB Output is correct
10 Correct 1020 ms 52940 KB Output is correct
11 Correct 855 ms 52544 KB Output is correct
12 Correct 882 ms 52580 KB Output is correct
13 Correct 789 ms 52124 KB Output is correct
14 Correct 842 ms 52208 KB Output is correct
15 Correct 650 ms 52908 KB Output is correct
16 Correct 583 ms 52948 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 2 ms 344 KB Output is correct
21 Correct 2 ms 344 KB Output is correct
22 Correct 2 ms 516 KB Output is correct
23 Correct 2 ms 344 KB Output is correct
24 Correct 2 ms 512 KB Output is correct
25 Correct 1 ms 500 KB Output is correct
26 Correct 1 ms 600 KB Output is correct
27 Correct 9 ms 600 KB Output is correct
28 Correct 11 ms 864 KB Output is correct
29 Correct 10 ms 600 KB Output is correct
30 Correct 11 ms 856 KB Output is correct
31 Correct 13 ms 856 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 96 ms 26584 KB Output is correct
34 Correct 202 ms 52060 KB Output is correct
35 Correct 164 ms 52820 KB Output is correct
36 Correct 194 ms 51896 KB Output is correct
37 Correct 118 ms 52364 KB Output is correct
38 Correct 80 ms 52912 KB Output is correct

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 198 ms 20972 KB Output is correct
5 Correct 904 ms 51944 KB Output is correct
6 Correct 424 ms 7892 KB Output is correct
7 Correct 719 ms 51876 KB Output is correct
8 Correct 387 ms 16112 KB Output is correct
9 Correct 785 ms 52120 KB Output is correct
10 Correct 1020 ms 52940 KB Output is correct
11 Correct 855 ms 52544 KB Output is correct
12 Correct 882 ms 52580 KB Output is correct
13 Correct 789 ms 52124 KB Output is correct
14 Correct 842 ms 52208 KB Output is correct
15 Correct 650 ms 52908 KB Output is correct
16 Correct 583 ms 52948 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 2 ms 344 KB Output is correct
21 Correct 2 ms 344 KB Output is correct
22 Correct 2 ms 516 KB Output is correct
23 Correct 2 ms 344 KB Output is correct
24 Correct 2 ms 512 KB Output is correct
25 Correct 1 ms 500 KB Output is correct
26 Correct 1 ms 600 KB Output is correct
27 Correct 9 ms 600 KB Output is correct
28 Correct 11 ms 864 KB Output is correct
29 Correct 10 ms 600 KB Output is correct
30 Correct 11 ms 856 KB Output is correct
31 Correct 13 ms 856 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 96 ms 26584 KB Output is correct
34 Correct 202 ms 52060 KB Output is correct
35 Correct 164 ms 52820 KB Output is correct
36 Correct 194 ms 51896 KB Output is correct
37 Correct 118 ms 52364 KB Output is correct
38 Correct 80 ms 52912 KB Output is correct
39 Correct 0 ms 344 KB Output is correct
40 Correct 0 ms 344 KB Output is correct
41 Correct 0 ms 344 KB Output is correct
42 Correct 228 ms 21200 KB Output is correct
43 Correct 809 ms 52116 KB Output is correct
44 Correct 441 ms 7892 KB Output is correct
45 Correct 819 ms 52128 KB Output is correct
46 Correct 428 ms 16060 KB Output is correct
47 Correct 761 ms 52128 KB Output is correct
48 Correct 1000 ms 52892 KB Output is correct
49 Correct 827 ms 52652 KB Output is correct
50 Correct 901 ms 52680 KB Output is correct
51 Correct 838 ms 52120 KB Output is correct
52 Correct 850 ms 52356 KB Output is correct
53 Correct 666 ms 52940 KB Output is correct
54 Correct 640 ms 52892 KB Output is correct
55 Correct 1 ms 344 KB Output is correct
56 Correct 244 ms 51816 KB Output is correct
57 Correct 795 ms 52120 KB Output is correct
58 Correct 310 ms 8440 KB Output is correct
59 Correct 835 ms 52136 KB Output is correct
60 Correct 288 ms 16572 KB Output is correct
61 Correct 807 ms 51904 KB Output is correct
62 Execution timed out 4011 ms 52940 KB Time limit exceeded
63 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Execution timed out 4064 ms 41992 KB Time limit exceeded
4 Halted 0 ms 0 KB -