oj.uz

Submission #515091

# Submission time Handle Problem Language Result Execution time Memory
515091 2022-01-19T03:01:29 Z minhcool Rainforest Jumps (APIO21_jumps) C++17
44 / 100
 1172 ms 106796 KB 
#include<bits/stdc++.h>
using namespace std;
 
//#define int long long
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define foru(i, l, r) for(int i = l; i <= r; i++)
#define ford(i, r, l) for(int i = r; i >= l; i--)
 
typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;
 
const int N = 3e5 + 5;
 
const int oo = 1e9 + 7, mod = 1e9 + 7;
 
int n, h[N];
 
int nxtl[N], nxtr[N];
 
int small_jump[N][20], large_jump[N][20];
 
ii mx[N][20];
 
void init(int _n, vector<int> _H){
	n = _n;
	for(int i = 1; i <= n; i++) h[i] = _H[i - 1];
	h[0] = h[n + 1] = oo;
	stack<int> stk;
	stk.push(0);
	for(int i = 1; i <= n; i++){
		while(h[stk.top()] < h[i]) stk.pop();
		nxtl[i] = stk.top();
		stk.push(i);
	}
    //return;
	while(!stk.empty()) stk.pop();
	stk.push(n + 1);
	for(int i = n; i >= 1; i--){
		while(h[stk.top()] < h[i]) stk.pop();
		nxtr[i] = stk.top();
		stk.push(i);
	}
    //return;
	for(int i = 1; i <= n; i++){
		small_jump[i][0] = (h[nxtl[i]] < h[nxtr[i]] ? nxtl[i] : nxtr[i]);
		large_jump[i][0] = (h[nxtl[i]] > h[nxtr[i]] ? nxtl[i] : nxtr[i]);
	}
	for(int i = 1; i <= n; i++) mx[i][0] = {h[i], i};
	for(int i = 1; i <= 19; i++){
		for(int j = 1; (j + (1LL << i) - 1) <= n; j++) mx[j][i] = max(mx[j][i - 1], mx[j + (1LL << (i - 1))][i - 1]);
	}
	for(int i = 1; i <= 19; i++){
		for(int j = 1; j <= n; j++){
			small_jump[j][i] = small_jump[small_jump[j][i - 1]][i - 1];
			large_jump[j][i] = large_jump[large_jump[j][i - 1]][i - 1];
		}
	}
}
 
ii maxi(int l, int r){
	if(l > r) return {-oo, -oo};
	int k = log2(r - l + 1);
	return max(mx[l][k], mx[r - (1LL << k) + 1][k]);
}

int cal(int a, int c){
	int answer = 0;
	for(int i = 19; i >= 0; i--){
		if(h[large_jump[a][i]] <= h[c]){
			answer += (1LL << i);
			a = large_jump[a][i];
		}
	}
	for(int i = 19; i >= 0; i--){
		if(h[small_jump[a][i]] <= h[c]){
			answer += (1LL << i);
			a = small_jump[a][i];
		}
	}
	if(a != c) return -1;
	else return answer;
}
 
int minimum_jumps(int a, int b, int c, int d){
    //return -1;
	a++, b++, c++, d++;
	assert(c == d);
	if(h[b] > h[c]){
		return -1;
	}
	int l = a, r = b;
	while(l < r){
		int mid = (l + r) >> 1;
		if(maxi(mid, b).fi > h[c]) l = mid + 1;
		else r = mid;
	}
	int pos = maxi(l, b).se;
	return cal(pos, c);
}
 
/*
void process(){
 
}
 
signed main(){
	ios_base::sync_with_stdio(0);
	process();
}*/

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Runtime error 129 ms 106796 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 3 ms 456 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 3 ms 456 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 2 ms 456 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 0 ms 328 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 0 ms 328 KB Output is correct
4 Correct 261 ms 30744 KB Output is correct
5 Correct 984 ms 66892 KB Output is correct
6 Correct 645 ms 11208 KB Output is correct
7 Correct 930 ms 66752 KB Output is correct
8 Correct 433 ms 23240 KB Output is correct
9 Correct 960 ms 66832 KB Output is correct
10 Correct 910 ms 67588 KB Output is correct
11 Correct 835 ms 67720 KB Output is correct
12 Correct 742 ms 67520 KB Output is correct
13 Correct 885 ms 66748 KB Output is correct
14 Correct 1122 ms 67240 KB Output is correct
15 Correct 896 ms 67732 KB Output is correct
16 Correct 1069 ms 67632 KB Output is correct
17 Correct 0 ms 328 KB Output is correct
18 Correct 0 ms 328 KB Output is correct
19 Correct 2 ms 328 KB Output is correct
20 Correct 2 ms 328 KB Output is correct
21 Correct 2 ms 328 KB Output is correct
22 Correct 2 ms 328 KB Output is correct
23 Correct 2 ms 328 KB Output is correct
24 Correct 3 ms 328 KB Output is correct
25 Correct 1 ms 328 KB Output is correct
26 Correct 1 ms 456 KB Output is correct
27 Correct 23 ms 968 KB Output is correct
28 Correct 19 ms 968 KB Output is correct
29 Correct 16 ms 968 KB Output is correct
30 Correct 16 ms 968 KB Output is correct
31 Correct 14 ms 968 KB Output is correct
32 Correct 0 ms 328 KB Output is correct
33 Correct 78 ms 38836 KB Output is correct
34 Correct 157 ms 66752 KB Output is correct
35 Correct 119 ms 67500 KB Output is correct
36 Correct 149 ms 66856 KB Output is correct
37 Correct 134 ms 67192 KB Output is correct
38 Correct 131 ms 67728 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 0 ms 328 KB Output is correct
4 Correct 261 ms 30744 KB Output is correct
5 Correct 984 ms 66892 KB Output is correct
6 Correct 645 ms 11208 KB Output is correct
7 Correct 930 ms 66752 KB Output is correct
8 Correct 433 ms 23240 KB Output is correct
9 Correct 960 ms 66832 KB Output is correct
10 Correct 910 ms 67588 KB Output is correct
11 Correct 835 ms 67720 KB Output is correct
12 Correct 742 ms 67520 KB Output is correct
13 Correct 885 ms 66748 KB Output is correct
14 Correct 1122 ms 67240 KB Output is correct
15 Correct 896 ms 67732 KB Output is correct
16 Correct 1069 ms 67632 KB Output is correct
17 Correct 0 ms 328 KB Output is correct
18 Correct 0 ms 328 KB Output is correct
19 Correct 2 ms 328 KB Output is correct
20 Correct 2 ms 328 KB Output is correct
21 Correct 2 ms 328 KB Output is correct
22 Correct 2 ms 328 KB Output is correct
23 Correct 2 ms 328 KB Output is correct
24 Correct 3 ms 328 KB Output is correct
25 Correct 1 ms 328 KB Output is correct
26 Correct 1 ms 456 KB Output is correct
27 Correct 23 ms 968 KB Output is correct
28 Correct 19 ms 968 KB Output is correct
29 Correct 16 ms 968 KB Output is correct
30 Correct 16 ms 968 KB Output is correct
31 Correct 14 ms 968 KB Output is correct
32 Correct 0 ms 328 KB Output is correct
33 Correct 78 ms 38836 KB Output is correct
34 Correct 157 ms 66752 KB Output is correct
35 Correct 119 ms 67500 KB Output is correct
36 Correct 149 ms 66856 KB Output is correct
37 Correct 134 ms 67192 KB Output is correct
38 Correct 131 ms 67728 KB Output is correct
39 Correct 1 ms 328 KB Output is correct
40 Correct 0 ms 328 KB Output is correct
41 Correct 0 ms 328 KB Output is correct
42 Correct 296 ms 30712 KB Output is correct
43 Correct 1004 ms 66848 KB Output is correct
44 Correct 598 ms 11208 KB Output is correct
45 Correct 1074 ms 66860 KB Output is correct
46 Correct 554 ms 23228 KB Output is correct
47 Correct 875 ms 66848 KB Output is correct
48 Correct 1082 ms 67616 KB Output is correct
49 Correct 1093 ms 67520 KB Output is correct
50 Correct 981 ms 67480 KB Output is correct
51 Correct 866 ms 66864 KB Output is correct
52 Correct 927 ms 67220 KB Output is correct
53 Correct 717 ms 67680 KB Output is correct
54 Correct 894 ms 67628 KB Output is correct
55 Correct 0 ms 328 KB Output is correct
56 Correct 193 ms 66492 KB Output is correct
57 Correct 1172 ms 66852 KB Output is correct
58 Correct 644 ms 12000 KB Output is correct
59 Correct 790 ms 66860 KB Output is correct
60 Correct 353 ms 23824 KB Output is correct
61 Correct 921 ms 66968 KB Output is correct
62 Correct 989 ms 67648 KB Output is correct
63 Correct 997 ms 67472 KB Output is correct
64 Correct 1159 ms 67388 KB Output is correct
65 Correct 947 ms 66832 KB Output is correct
66 Correct 1090 ms 67220 KB Output is correct
67 Correct 829 ms 67676 KB Output is correct
68 Correct 921 ms 67588 KB Output is correct
69 Correct 1 ms 328 KB Output is correct
70 Correct 0 ms 292 KB Output is correct
71 Correct 2 ms 328 KB Output is correct
72 Correct 2 ms 288 KB Output is correct
73 Correct 4 ms 328 KB Output is correct
74 Correct 2 ms 328 KB Output is correct
75 Correct 2 ms 328 KB Output is correct
76 Correct 1 ms 328 KB Output is correct
77 Correct 0 ms 328 KB Output is correct
78 Correct 2 ms 328 KB Output is correct
79 Correct 2 ms 328 KB Output is correct
80 Correct 2 ms 328 KB Output is correct
81 Correct 2 ms 328 KB Output is correct
82 Correct 2 ms 328 KB Output is correct
83 Correct 3 ms 328 KB Output is correct
84 Correct 0 ms 328 KB Output is correct
85 Correct 4 ms 328 KB Output is correct
86 Correct 16 ms 928 KB Output is correct
87 Correct 17 ms 980 KB Output is correct
88 Correct 22 ms 968 KB Output is correct
89 Correct 18 ms 936 KB Output is correct
90 Correct 15 ms 968 KB Output is correct
91 Correct 0 ms 328 KB Output is correct
92 Correct 1 ms 456 KB Output is correct
93 Correct 21 ms 968 KB Output is correct
94 Correct 20 ms 968 KB Output is correct
95 Correct 29 ms 968 KB Output is correct
96 Correct 16 ms 932 KB Output is correct
97 Correct 16 ms 968 KB Output is correct
98 Correct 0 ms 328 KB Output is correct
99 Correct 123 ms 66700 KB Output is correct
100 Correct 119 ms 66836 KB Output is correct
101 Correct 116 ms 67492 KB Output is correct
102 Correct 118 ms 66856 KB Output is correct
103 Correct 134 ms 67224 KB Output is correct
104 Correct 127 ms 67648 KB Output is correct
105 Correct 0 ms 328 KB Output is correct
106 Correct 86 ms 38812 KB Output is correct
107 Correct 134 ms 66856 KB Output is correct
108 Correct 115 ms 67480 KB Output is correct
109 Correct 126 ms 66860 KB Output is correct
110 Correct 149 ms 67340 KB Output is correct
111 Correct 114 ms 67688 KB Output is correct

Subtask #7
0 / 19.0

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