oj.uz

Submission #515085

# Submission time Handle Problem Language Result Execution time Memory
515085 2022-01-19T02:54:25 Z minhcool Rainforest Jumps (APIO21_jumps) C++17
23 / 100
 1347 ms 133260 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 minimum_jumps(int a, int b, int c, int d){
    //return -1;
	a++, b++, c++, d++;
	assert(a == b && c == d);
	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;
}
 
/*
void process(){
 
}
 
signed main(){
	ios_base::sync_with_stdio(0);
	process();
}*/

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Runtime error 145 ms 106804 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 2 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 2 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 1 ms 328 KB Output is correct
3 Correct 0 ms 328 KB Output is correct
4 Correct 365 ms 30616 KB Output is correct
5 Correct 931 ms 66860 KB Output is correct
6 Correct 803 ms 11284 KB Output is correct
7 Correct 1018 ms 66856 KB Output is correct
8 Correct 627 ms 23192 KB Output is correct
9 Correct 1139 ms 66932 KB Output is correct
10 Correct 1227 ms 67608 KB Output is correct
11 Correct 1347 ms 67616 KB Output is correct
12 Correct 1008 ms 67500 KB Output is correct
13 Correct 1190 ms 66856 KB Output is correct
14 Correct 1206 ms 67192 KB Output is correct
15 Correct 1031 ms 67612 KB Output is correct
16 Correct 974 ms 67628 KB Output is correct
17 Correct 0 ms 200 KB Output is correct
18 Correct 0 ms 328 KB Output is correct
19 Correct 1 ms 328 KB Output is correct
20 Correct 3 ms 328 KB Output is correct
21 Correct 3 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 2 ms 376 KB Output is correct
25 Correct 0 ms 328 KB Output is correct
26 Correct 1 ms 456 KB Output is correct
27 Correct 19 ms 968 KB Output is correct
28 Correct 18 ms 968 KB Output is correct
29 Correct 27 ms 940 KB Output is correct
30 Correct 20 ms 968 KB Output is correct
31 Correct 21 ms 968 KB Output is correct
32 Correct 0 ms 328 KB Output is correct
33 Correct 73 ms 38812 KB Output is correct
34 Correct 134 ms 66752 KB Output is correct
35 Correct 119 ms 67472 KB Output is correct
36 Correct 129 ms 66856 KB Output is correct
37 Correct 182 ms 67164 KB Output is correct
38 Correct 125 ms 67596 KB Output is correct

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 0 ms 328 KB Output is correct
4 Correct 365 ms 30616 KB Output is correct
5 Correct 931 ms 66860 KB Output is correct
6 Correct 803 ms 11284 KB Output is correct
7 Correct 1018 ms 66856 KB Output is correct
8 Correct 627 ms 23192 KB Output is correct
9 Correct 1139 ms 66932 KB Output is correct
10 Correct 1227 ms 67608 KB Output is correct
11 Correct 1347 ms 67616 KB Output is correct
12 Correct 1008 ms 67500 KB Output is correct
13 Correct 1190 ms 66856 KB Output is correct
14 Correct 1206 ms 67192 KB Output is correct
15 Correct 1031 ms 67612 KB Output is correct
16 Correct 974 ms 67628 KB Output is correct
17 Correct 0 ms 200 KB Output is correct
18 Correct 0 ms 328 KB Output is correct
19 Correct 1 ms 328 KB Output is correct
20 Correct 3 ms 328 KB Output is correct
21 Correct 3 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 2 ms 376 KB Output is correct
25 Correct 0 ms 328 KB Output is correct
26 Correct 1 ms 456 KB Output is correct
27 Correct 19 ms 968 KB Output is correct
28 Correct 18 ms 968 KB Output is correct
29 Correct 27 ms 940 KB Output is correct
30 Correct 20 ms 968 KB Output is correct
31 Correct 21 ms 968 KB Output is correct
32 Correct 0 ms 328 KB Output is correct
33 Correct 73 ms 38812 KB Output is correct
34 Correct 134 ms 66752 KB Output is correct
35 Correct 119 ms 67472 KB Output is correct
36 Correct 129 ms 66856 KB Output is correct
37 Correct 182 ms 67164 KB Output is correct
38 Correct 125 ms 67596 KB Output is correct
39 Correct 0 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 177 ms 30616 KB Output is correct
43 Correct 787 ms 66856 KB Output is correct
44 Correct 459 ms 11312 KB Output is correct
45 Correct 917 ms 66828 KB Output is correct
46 Correct 514 ms 23192 KB Output is correct
47 Correct 1016 ms 66796 KB Output is correct
48 Correct 1183 ms 67596 KB Output is correct
49 Correct 811 ms 67612 KB Output is correct
50 Correct 743 ms 67472 KB Output is correct
51 Correct 768 ms 66832 KB Output is correct
52 Correct 789 ms 67164 KB Output is correct
53 Correct 1130 ms 67596 KB Output is correct
54 Correct 976 ms 67628 KB Output is correct
55 Correct 1 ms 328 KB Output is correct
56 Runtime error 181 ms 133260 KB Execution killed with signal 6
57 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

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