oj.uz

Submission #977975

# Submission time Handle Problem Language Result Execution time Memory
977975 2024-05-08T15:20:11 Z rshohruh Rainforest Jumps (APIO21_jumps) C++17
48 / 100
 984 ms 57004 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;
int ok = 1;
void init(int N, std::vector<int> H)
{
	for(int i = 0; i < N; ++i) ok &= (H[i] == i+1);
	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;

		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];
		}
	}

}

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)
{
	if(ok) return C - B;
	int res = inf;
	// for(int id = C; id <= D; ++id){
		int id = st.get(C, D);
		if(h[B] > h[id]) return -1;

		int L = st.getmax(A, B, h[id]);
		int mx_id = st.get(max(L+1, A), B);

		res = min(res, ans(mx_id, id));
	// }
	return (res == inf ? -1 : res);
}

Subtask #1
4.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 Correct 151 ms 45344 KB Output is correct
4 Correct 722 ms 56852 KB Output is correct
5 Correct 538 ms 25684 KB Output is correct
6 Correct 674 ms 56736 KB Output is correct
7 Correct 537 ms 38800 KB Output is correct
8 Correct 756 ms 57004 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 356 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 Incorrect 1 ms 344 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 356 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 Incorrect 1 ms 344 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 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 121 ms 45796 KB Output is correct
6 Correct 190 ms 56836 KB Output is correct
7 Correct 69 ms 26036 KB Output is correct
8 Correct 163 ms 56992 KB Output is correct
9 Correct 13 ms 8016 KB Output is correct
10 Correct 174 ms 56776 KB Output is correct
11 Correct 142 ms 56992 KB Output is correct
12 Incorrect 84 ms 56816 KB Output isn't correct
13 Halted 0 ms 0 KB -

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 0 ms 344 KB Output is correct
4 Correct 201 ms 23372 KB Output is correct
5 Correct 754 ms 56800 KB Output is correct
6 Correct 462 ms 8736 KB Output is correct
7 Correct 783 ms 56752 KB Output is correct
8 Correct 401 ms 17588 KB Output is correct
9 Correct 787 ms 56656 KB Output is correct
10 Correct 645 ms 56888 KB Output is correct
11 Correct 889 ms 56820 KB Output is correct
12 Correct 984 ms 56756 KB Output is correct
13 Correct 805 ms 56824 KB Output is correct
14 Correct 871 ms 56820 KB Output is correct
15 Correct 629 ms 56740 KB Output is correct
16 Correct 606 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 1 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 11 ms 888 KB Output is correct
28 Correct 9 ms 856 KB Output is correct
29 Correct 10 ms 1112 KB Output is correct
30 Correct 10 ms 1112 KB Output is correct
31 Correct 9 ms 856 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 80 ms 29344 KB Output is correct
34 Correct 164 ms 56748 KB Output is correct
35 Correct 133 ms 56812 KB Output is correct
36 Correct 160 ms 56756 KB Output is correct
37 Correct 109 ms 56604 KB Output is correct
38 Correct 73 ms 56884 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 0 ms 344 KB Output is correct
4 Correct 201 ms 23372 KB Output is correct
5 Correct 754 ms 56800 KB Output is correct
6 Correct 462 ms 8736 KB Output is correct
7 Correct 783 ms 56752 KB Output is correct
8 Correct 401 ms 17588 KB Output is correct
9 Correct 787 ms 56656 KB Output is correct
10 Correct 645 ms 56888 KB Output is correct
11 Correct 889 ms 56820 KB Output is correct
12 Correct 984 ms 56756 KB Output is correct
13 Correct 805 ms 56824 KB Output is correct
14 Correct 871 ms 56820 KB Output is correct
15 Correct 629 ms 56740 KB Output is correct
16 Correct 606 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 1 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 11 ms 888 KB Output is correct
28 Correct 9 ms 856 KB Output is correct
29 Correct 10 ms 1112 KB Output is correct
30 Correct 10 ms 1112 KB Output is correct
31 Correct 9 ms 856 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 80 ms 29344 KB Output is correct
34 Correct 164 ms 56748 KB Output is correct
35 Correct 133 ms 56812 KB Output is correct
36 Correct 160 ms 56756 KB Output is correct
37 Correct 109 ms 56604 KB Output is correct
38 Correct 73 ms 56884 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 191 ms 23372 KB Output is correct
43 Correct 790 ms 56988 KB Output is correct
44 Correct 459 ms 8660 KB Output is correct
45 Correct 788 ms 56820 KB Output is correct
46 Correct 398 ms 17480 KB Output is correct
47 Correct 811 ms 56836 KB Output is correct
48 Correct 704 ms 56732 KB Output is correct
49 Correct 882 ms 56812 KB Output is correct
50 Correct 908 ms 56884 KB Output is correct
51 Correct 783 ms 56648 KB Output is correct
52 Correct 851 ms 56820 KB Output is correct
53 Correct 633 ms 56752 KB Output is correct
54 Correct 671 ms 56868 KB Output is correct
55 Correct 0 ms 344 KB Output is correct
56 Correct 210 ms 56756 KB Output is correct
57 Correct 813 ms 56820 KB Output is correct
58 Correct 318 ms 9144 KB Output is correct
59 Correct 811 ms 56752 KB Output is correct
60 Correct 290 ms 18276 KB Output is correct
61 Correct 774 ms 56816 KB Output is correct
62 Correct 666 ms 56856 KB Output is correct
63 Correct 909 ms 56732 KB Output is correct
64 Correct 876 ms 56732 KB Output is correct
65 Correct 792 ms 56744 KB Output is correct
66 Correct 839 ms 56824 KB Output is correct
67 Correct 654 ms 56752 KB Output is correct
68 Correct 646 ms 56864 KB Output is correct
69 Correct 0 ms 344 KB Output is correct
70 Correct 0 ms 344 KB Output is correct
71 Correct 1 ms 596 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 12 ms 892 KB Output is correct
87 Correct 11 ms 896 KB Output is correct
88 Correct 9 ms 892 KB Output is correct
89 Correct 10 ms 896 KB Output is correct
90 Correct 8 ms 856 KB Output is correct
91 Correct 0 ms 344 KB Output is correct
92 Correct 1 ms 600 KB Output is correct
93 Correct 13 ms 1112 KB Output is correct
94 Correct 10 ms 856 KB Output is correct
95 Correct 9 ms 1112 KB Output is correct
96 Correct 10 ms 892 KB Output is correct
97 Correct 10 ms 856 KB Output is correct
98 Correct 0 ms 344 KB Output is correct
99 Correct 157 ms 56500 KB Output is correct
100 Correct 169 ms 56748 KB Output is correct
101 Correct 106 ms 56820 KB Output is correct
102 Correct 134 ms 56632 KB Output is correct
103 Correct 117 ms 56732 KB Output is correct
104 Correct 82 ms 56864 KB Output is correct
105 Correct 0 ms 344 KB Output is correct
106 Correct 77 ms 29324 KB Output is correct
107 Correct 176 ms 56836 KB Output is correct
108 Correct 114 ms 56760 KB Output is correct
109 Correct 139 ms 56736 KB Output is correct
110 Correct 111 ms 56812 KB Output is correct
111 Correct 74 ms 56732 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 Correct 151 ms 45344 KB Output is correct
4 Correct 722 ms 56852 KB Output is correct
5 Correct 538 ms 25684 KB Output is correct
6 Correct 674 ms 56736 KB Output is correct
7 Correct 537 ms 38800 KB Output is correct
8 Correct 756 ms 57004 KB Output is correct
9 Correct 0 ms 356 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Incorrect 1 ms 344 KB Output isn't correct
14 Halted 0 ms 0 KB -