oj.uz

Submission #977947

# Submission time Handle Problem Language Result Execution time Memory
977947 2024-05-08T14:25:28 Z rshohruh Rainforest Jumps (APIO21_jumps) C++17
77 / 100
 4000 ms 57024 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;

using node = int;
struct segment_tree{
	vector<node> t;
	vector<int> a;
	int n;

	node merge(node l, node r){
		return a[l] > a[r] ? l : r;
	}

	void build(int v, int l, int r){
		if(l == r){
			t[v] = l-1;
			return;
		}
		int m = (l + r) >> 1;
		build(v<<1, l, m);
		build(v<<1|1, m+1, r);
		t[v] = merge(t[v<<1], t[v<<1|1]);
	}
	
	node getmax(int v, int l, int r, int L, int R, int x){
		if(a[t[v]] < x) return -1;
		if(l == r) return t[v];
		int m = (l + r) / 2;
		if(R <= m) return getmax(v*2, l, m, L, R, x);
		else if(L > m) return getmax(v*2+1, m+1, r, L, R, x);
		else{
			int ans = getmax(v*2+1, m+1, r, m+1, R, x);
			if(ans != -1) return ans;
			else return getmax(v*2, l, m, L, m, x);
		}
	}

	node getmax(int L, int R, int x){
		return getmax(1, 1, n, L+1, R+1, x);
	}

	node get(int v, int l, int r, int L, int R){
		if(L == l && R == r)
			return t[v];
		
		int m = (l + r) >> 1;
		if(R <= m) return get(v<<1, l, m, L, R);
		else if(L > m) return get(v<<1|1, m+1, r, L, R);
		else {
			return merge(
				get(v<<1, l, m, L, m),
				get(v<<1|1, m+1, r, m+1, R)
			);
		}
	}
	node get(int L, int R){
		return get(1,1,n,L+1, R+1);
	}
	segment_tree(vector<int>a):a(a){
		n = (int)a.size();
		t.resize(n<<2);
		build(1, 1, n);
	}
	segment_tree() {}
};

segment_tree st;

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));
	st = segment_tree(h);
	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){
		if(h[B] > h[id]) continue;

		int L = st.getmax(A, B, h[id]);
		// cerr << "\n----" << L << "---\n";
		int mx_id = st.get(max(L+1, A), B);

		// 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 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Execution timed out 4041 ms 45344 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 352 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 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 340 KB Output is correct
15 Correct 2 ms 344 KB Output is correct
16 Correct 2 ms 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 1 ms 596 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 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 596 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 0 ms 344 KB Output is correct
36 Correct 0 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 1 ms 344 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 352 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 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 340 KB Output is correct
15 Correct 2 ms 344 KB Output is correct
16 Correct 2 ms 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 1 ms 596 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 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 596 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 0 ms 344 KB Output is correct
36 Correct 0 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 1 ms 344 KB Output is correct
40 Correct 1 ms 344 KB Output is correct
41 Correct 0 ms 344 KB Output is correct
42 Correct 0 ms 344 KB Output is correct
43 Correct 0 ms 344 KB Output is correct
44 Correct 1 ms 344 KB Output is correct
45 Correct 1 ms 344 KB Output is correct
46 Correct 1 ms 344 KB Output is correct
47 Correct 1 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 344 KB Output is correct
51 Correct 2 ms 344 KB Output is correct
52 Correct 2 ms 344 KB Output is correct
53 Correct 2 ms 344 KB Output is correct
54 Correct 2 ms 344 KB Output is correct
55 Correct 2 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 27 ms 600 KB Output is correct
59 Correct 35 ms 856 KB Output is correct
60 Correct 5 ms 600 KB Output is correct
61 Correct 35 ms 1112 KB Output is correct
62 Correct 10 ms 344 KB Output is correct
63 Correct 40 ms 884 KB Output is correct
64 Correct 70 ms 856 KB Output is correct
65 Correct 67 ms 1108 KB Output is correct
66 Correct 75 ms 856 KB Output is correct
67 Correct 44 ms 888 KB Output is correct
68 Correct 47 ms 896 KB Output is correct
69 Correct 20 ms 856 KB Output is correct
70 Correct 68 ms 856 KB Output is correct
71 Correct 0 ms 344 KB Output is correct
72 Correct 1 ms 344 KB Output is correct
73 Correct 1 ms 344 KB Output is correct
74 Correct 1 ms 344 KB Output is correct
75 Correct 1 ms 344 KB Output is correct
76 Correct 1 ms 344 KB Output is correct
77 Correct 2 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 1 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 344 KB Output is correct
87 Correct 1 ms 344 KB Output is correct
88 Correct 1 ms 344 KB Output is correct
89 Correct 1 ms 596 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 1 ms 344 KB Output is correct
94 Correct 2 ms 344 KB Output is correct
95 Correct 9 ms 1112 KB Output is correct
96 Correct 11 ms 868 KB Output is correct
97 Correct 11 ms 872 KB Output is correct
98 Correct 10 ms 1012 KB Output is correct
99 Correct 9 ms 856 KB Output is correct
100 Correct 1 ms 344 KB Output is correct
101 Correct 1 ms 600 KB Output is correct
102 Correct 11 ms 900 KB Output is correct
103 Correct 10 ms 856 KB Output is correct
104 Correct 9 ms 888 KB Output is correct
105 Correct 9 ms 900 KB Output is correct
106 Correct 10 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 1 ms 856 KB Output is correct
110 Correct 1 ms 856 KB Output is correct
111 Correct 1 ms 856 KB Output is correct
112 Correct 1 ms 856 KB Output is correct
113 Correct 1 ms 856 KB Output is correct

Subtask #4
12.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 133 ms 45644 KB Output is correct
6 Correct 164 ms 56640 KB Output is correct
7 Correct 69 ms 26084 KB Output is correct
8 Correct 177 ms 56812 KB Output is correct
9 Correct 13 ms 8016 KB Output is correct
10 Correct 167 ms 56820 KB Output is correct
11 Correct 156 ms 56760 KB Output is correct
12 Correct 130 ms 56640 KB Output is correct
13 Correct 104 ms 56640 KB Output is correct
14 Correct 152 ms 56732 KB Output is correct
15 Correct 133 ms 56820 KB Output is correct
16 Correct 77 ms 56816 KB Output is correct
17 Correct 93 ms 56732 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 1 ms 600 KB Output is correct
27 Correct 1 ms 856 KB Output is correct
28 Correct 1 ms 856 KB Output is correct
29 Correct 1 ms 856 KB Output is correct
30 Correct 1 ms 856 KB Output is correct
31 Correct 1 ms 856 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 171 ms 56496 KB Output is correct
34 Correct 166 ms 56740 KB Output is correct
35 Correct 104 ms 56752 KB Output is correct
36 Correct 126 ms 56740 KB Output is correct
37 Correct 139 ms 56820 KB Output is correct
38 Correct 80 ms 56760 KB Output is correct
39 Correct 0 ms 344 KB Output is correct
40 Correct 71 ms 29472 KB Output is correct
41 Correct 166 ms 56760 KB Output is correct
42 Correct 108 ms 56740 KB Output is correct
43 Correct 130 ms 56764 KB Output is correct
44 Correct 105 ms 56824 KB Output is correct
45 Correct 64 ms 56752 KB Output is correct

Subtask #5
23.0 / 23.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 1 ms 344 KB Output is correct
4 Correct 185 ms 23220 KB Output is correct
5 Correct 830 ms 56624 KB Output is correct
6 Correct 442 ms 8680 KB Output is correct
7 Correct 750 ms 56732 KB Output is correct
8 Correct 417 ms 17476 KB Output is correct
9 Correct 781 ms 56752 KB Output is correct
10 Correct 1008 ms 56684 KB Output is correct
11 Correct 831 ms 56828 KB Output is correct
12 Correct 862 ms 56640 KB Output is correct
13 Correct 763 ms 56836 KB Output is correct
14 Correct 849 ms 56820 KB Output is correct
15 Correct 662 ms 56736 KB Output is correct
16 Correct 638 ms 56752 KB Output is correct
17 Correct 0 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 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 2 ms 344 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 600 KB Output is correct
27 Correct 9 ms 896 KB Output is correct
28 Correct 9 ms 856 KB Output is correct
29 Correct 14 ms 892 KB Output is correct
30 Correct 11 ms 1112 KB Output is correct
31 Correct 8 ms 856 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 71 ms 29284 KB Output is correct
34 Correct 172 ms 56816 KB Output is correct
35 Correct 109 ms 56736 KB Output is correct
36 Correct 130 ms 56756 KB Output is correct
37 Correct 129 ms 56928 KB Output is correct
38 Correct 75 ms 57024 KB Output is correct

Subtask #6
21.0 / 21.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 1 ms 344 KB Output is correct
4 Correct 185 ms 23220 KB Output is correct
5 Correct 830 ms 56624 KB Output is correct
6 Correct 442 ms 8680 KB Output is correct
7 Correct 750 ms 56732 KB Output is correct
8 Correct 417 ms 17476 KB Output is correct
9 Correct 781 ms 56752 KB Output is correct
10 Correct 1008 ms 56684 KB Output is correct
11 Correct 831 ms 56828 KB Output is correct
12 Correct 862 ms 56640 KB Output is correct
13 Correct 763 ms 56836 KB Output is correct
14 Correct 849 ms 56820 KB Output is correct
15 Correct 662 ms 56736 KB Output is correct
16 Correct 638 ms 56752 KB Output is correct
17 Correct 0 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 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 2 ms 344 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 600 KB Output is correct
27 Correct 9 ms 896 KB Output is correct
28 Correct 9 ms 856 KB Output is correct
29 Correct 14 ms 892 KB Output is correct
30 Correct 11 ms 1112 KB Output is correct
31 Correct 8 ms 856 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 71 ms 29284 KB Output is correct
34 Correct 172 ms 56816 KB Output is correct
35 Correct 109 ms 56736 KB Output is correct
36 Correct 130 ms 56756 KB Output is correct
37 Correct 129 ms 56928 KB Output is correct
38 Correct 75 ms 57024 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 192 ms 23272 KB Output is correct
43 Correct 773 ms 56584 KB Output is correct
44 Correct 456 ms 8732 KB Output is correct
45 Correct 766 ms 56752 KB Output is correct
46 Correct 409 ms 17592 KB Output is correct
47 Correct 860 ms 56752 KB Output is correct
48 Correct 951 ms 56992 KB Output is correct
49 Correct 884 ms 56744 KB Output is correct
50 Correct 925 ms 56752 KB Output is correct
51 Correct 785 ms 56760 KB Output is correct
52 Correct 822 ms 56848 KB Output is correct
53 Correct 695 ms 56760 KB Output is correct
54 Correct 597 ms 56728 KB Output is correct
55 Correct 0 ms 344 KB Output is correct
56 Correct 192 ms 56476 KB Output is correct
57 Correct 761 ms 56820 KB Output is correct
58 Correct 340 ms 9164 KB Output is correct
59 Correct 797 ms 56748 KB Output is correct
60 Correct 290 ms 18240 KB Output is correct
61 Correct 873 ms 56752 KB Output is correct
62 Correct 878 ms 56752 KB Output is correct
63 Correct 825 ms 56776 KB Output is correct
64 Correct 900 ms 56628 KB Output is correct
65 Correct 759 ms 56824 KB Output is correct
66 Correct 803 ms 56752 KB Output is correct
67 Correct 716 ms 56820 KB Output is correct
68 Correct 643 ms 56752 KB Output is correct
69 Correct 1 ms 344 KB Output is correct
70 Correct 1 ms 344 KB Output is correct
71 Correct 2 ms 344 KB Output is correct
72 Correct 1 ms 344 KB Output is correct
73 Correct 1 ms 344 KB Output is correct
74 Correct 1 ms 344 KB Output is correct
75 Correct 1 ms 344 KB Output is correct
76 Correct 0 ms 344 KB Output is correct
77 Correct 0 ms 344 KB Output is correct
78 Correct 1 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 1 ms 344 KB Output is correct
82 Correct 1 ms 344 KB Output is correct
83 Correct 1 ms 344 KB Output is correct
84 Correct 0 ms 344 KB Output is correct
85 Correct 2 ms 344 KB Output is correct
86 Correct 9 ms 896 KB Output is correct
87 Correct 14 ms 872 KB Output is correct
88 Correct 9 ms 1112 KB Output is correct
89 Correct 12 ms 892 KB Output is correct
90 Correct 10 ms 1108 KB Output is correct
91 Correct 0 ms 344 KB Output is correct
92 Correct 1 ms 600 KB Output is correct
93 Correct 10 ms 856 KB Output is correct
94 Correct 11 ms 856 KB Output is correct
95 Correct 11 ms 1112 KB Output is correct
96 Correct 10 ms 900 KB Output is correct
97 Correct 9 ms 856 KB Output is correct
98 Correct 0 ms 344 KB Output is correct
99 Correct 156 ms 56668 KB Output is correct
100 Correct 152 ms 56820 KB Output is correct
101 Correct 105 ms 56824 KB Output is correct
102 Correct 133 ms 56740 KB Output is correct
103 Correct 101 ms 56748 KB Output is correct
104 Correct 68 ms 56812 KB Output is correct
105 Correct 0 ms 596 KB Output is correct
106 Correct 89 ms 29464 KB Output is correct
107 Correct 157 ms 56832 KB Output is correct
108 Correct 106 ms 56736 KB Output is correct
109 Correct 140 ms 56832 KB Output is correct
110 Correct 100 ms 56760 KB Output is correct
111 Correct 71 ms 56868 KB Output is correct

Subtask #7
0 / 19.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 Execution timed out 4041 ms 45344 KB Time limit exceeded
4 Halted 0 ms 0 KB -