oj.uz

Submission #558984

# Submission time Handle Problem Language Result Execution time Memory
558984 2022-05-09T06:47:49 Z LastRonin Rainforest Jumps (APIO21_jumps) C++14
48 / 100
 1014 ms 47804 KB 
#include "jumps.h"

#include <bits/stdc++.h>

#define ll long long
#define pii pair<int, int>
#define f first
#define s second

using namespace std;

const int N = 2e5 + 10;

int bp[N][18];
int bp2[N][18];
int bp3[N][18];
int z[N], h[N];
int Le[N], Ri[N];

void init(int n, vector<int> H) {
	for(int j = 1; j <= n; j++)
		h[j] = H[j - 1];
    stack<int> L, R;
	for(int j = 1; j <= n; j++)
		z[h[j]] = j;
	for(int i = 1; i <= n; i++) {
		while(L.size() && L.top() <= h[i])L.pop();	
		if(L.size())
			Le[i] = L.top();
		L.push(h[i]);		
	}	
	for(int i = n; i >= 1; i--) {
		while(R.size() && R.top() <= h[i])R.pop();	
		if(R.size())
			Ri[i] = R.top();
		R.push(h[i]);		
	}
	for(int j = n; j >= 1; j--) {
		bp[z[j]][0] = (Le[z[j]] > Ri[z[j]] ? Le[z[j]] : Ri[z[j]]);
		bp2[z[j]][0] = Ri[z[j]];
		bp3[z[j]][0] = Le[z[j]];
		for(int i = 1; i < 18; i++) {
			bp[z[j]][i] = bp[z[bp[z[j]][i - 1]]][i - 1];
			bp2[z[j]][i] = bp2[z[bp2[z[j]][i - 1]]][i - 1];
			bp3[z[j]][i] = bp3[z[bp3[z[j]][i - 1]]][i - 1];
		}
	}	
}

int minimum_jumps(int A, int B, int C, int D) {
	A++, B++, C++, D++;
	for(int j = 17; j >= 0; j--) {
		if(bp3[B][j] == 0)continue;
		if(bp3[B][j] <= h[C] && z[bp3[B][j]] >= A) {
			B = z[bp3[B][j]];
		}		
	}
	ll cnt = 0;
	for(int j = 17; j >= 0; j--) {
		if(bp[B][j] == 0)continue;
		if(bp[B][j] <= h[C]) {
			cnt += (1<<j);
			B = z[bp[B][j]];
		}
	}
	for(int j = 17; j >= 0; j--) {
		if(bp2[B][j] == 0)continue;
		if(bp2[B][j] <= h[C]) {
			cnt += (1<<j);
			B = z[bp2[B][j]];
		}
	}
	if(B != C)return -1;
	return cnt;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 158 ms 37652 KB Output is correct
4 Correct 943 ms 47300 KB Output is correct
5 Correct 626 ms 23968 KB Output is correct
6 Correct 892 ms 47204 KB Output is correct
7 Correct 777 ms 32396 KB Output is correct
8 Correct 1014 ms 47300 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 336 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 336 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 336 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 233 ms 21912 KB Output is correct
5 Correct 886 ms 47264 KB Output is correct
6 Correct 617 ms 8016 KB Output is correct
7 Correct 812 ms 47264 KB Output is correct
8 Correct 502 ms 16464 KB Output is correct
9 Correct 921 ms 47176 KB Output is correct
10 Correct 1006 ms 47308 KB Output is correct
11 Correct 957 ms 47780 KB Output is correct
12 Correct 909 ms 47272 KB Output is correct
13 Correct 945 ms 47172 KB Output is correct
14 Correct 979 ms 47680 KB Output is correct
15 Correct 822 ms 47340 KB Output is correct
16 Correct 858 ms 47304 KB Output is correct
17 Correct 0 ms 336 KB Output is correct
18 Correct 0 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 3 ms 336 KB Output is correct
21 Correct 3 ms 336 KB Output is correct
22 Correct 2 ms 336 KB Output is correct
23 Correct 2 ms 336 KB Output is correct
24 Correct 2 ms 336 KB Output is correct
25 Correct 0 ms 336 KB Output is correct
26 Correct 1 ms 464 KB Output is correct
27 Correct 17 ms 720 KB Output is correct
28 Correct 18 ms 720 KB Output is correct
29 Correct 17 ms 720 KB Output is correct
30 Correct 19 ms 720 KB Output is correct
31 Correct 16 ms 720 KB Output is correct
32 Correct 0 ms 336 KB Output is correct
33 Correct 72 ms 27512 KB Output is correct
34 Correct 135 ms 47260 KB Output is correct
35 Correct 69 ms 47284 KB Output is correct
36 Correct 111 ms 47172 KB Output is correct
37 Correct 98 ms 47660 KB Output is correct
38 Correct 67 ms 47432 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 233 ms 21912 KB Output is correct
5 Correct 886 ms 47264 KB Output is correct
6 Correct 617 ms 8016 KB Output is correct
7 Correct 812 ms 47264 KB Output is correct
8 Correct 502 ms 16464 KB Output is correct
9 Correct 921 ms 47176 KB Output is correct
10 Correct 1006 ms 47308 KB Output is correct
11 Correct 957 ms 47780 KB Output is correct
12 Correct 909 ms 47272 KB Output is correct
13 Correct 945 ms 47172 KB Output is correct
14 Correct 979 ms 47680 KB Output is correct
15 Correct 822 ms 47340 KB Output is correct
16 Correct 858 ms 47304 KB Output is correct
17 Correct 0 ms 336 KB Output is correct
18 Correct 0 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 3 ms 336 KB Output is correct
21 Correct 3 ms 336 KB Output is correct
22 Correct 2 ms 336 KB Output is correct
23 Correct 2 ms 336 KB Output is correct
24 Correct 2 ms 336 KB Output is correct
25 Correct 0 ms 336 KB Output is correct
26 Correct 1 ms 464 KB Output is correct
27 Correct 17 ms 720 KB Output is correct
28 Correct 18 ms 720 KB Output is correct
29 Correct 17 ms 720 KB Output is correct
30 Correct 19 ms 720 KB Output is correct
31 Correct 16 ms 720 KB Output is correct
32 Correct 0 ms 336 KB Output is correct
33 Correct 72 ms 27512 KB Output is correct
34 Correct 135 ms 47260 KB Output is correct
35 Correct 69 ms 47284 KB Output is correct
36 Correct 111 ms 47172 KB Output is correct
37 Correct 98 ms 47660 KB Output is correct
38 Correct 67 ms 47432 KB Output is correct
39 Correct 0 ms 336 KB Output is correct
40 Correct 0 ms 336 KB Output is correct
41 Correct 0 ms 336 KB Output is correct
42 Correct 242 ms 21784 KB Output is correct
43 Correct 863 ms 47256 KB Output is correct
44 Correct 628 ms 8016 KB Output is correct
45 Correct 823 ms 47264 KB Output is correct
46 Correct 532 ms 16464 KB Output is correct
47 Correct 880 ms 47156 KB Output is correct
48 Correct 1006 ms 47304 KB Output is correct
49 Correct 812 ms 47804 KB Output is correct
50 Correct 965 ms 47304 KB Output is correct
51 Correct 935 ms 47228 KB Output is correct
52 Correct 894 ms 47652 KB Output is correct
53 Correct 828 ms 47392 KB Output is correct
54 Correct 808 ms 47364 KB Output is correct
55 Correct 0 ms 336 KB Output is correct
56 Correct 179 ms 47016 KB Output is correct
57 Correct 954 ms 47268 KB Output is correct
58 Correct 413 ms 8568 KB Output is correct
59 Correct 945 ms 47216 KB Output is correct
60 Correct 407 ms 16876 KB Output is correct
61 Correct 955 ms 47256 KB Output is correct
62 Correct 908 ms 47380 KB Output is correct
63 Correct 863 ms 47584 KB Output is correct
64 Correct 667 ms 47396 KB Output is correct
65 Correct 843 ms 47176 KB Output is correct
66 Correct 1012 ms 47648 KB Output is correct
67 Correct 845 ms 47656 KB Output is correct
68 Correct 839 ms 47304 KB Output is correct
69 Correct 0 ms 336 KB Output is correct
70 Correct 1 ms 336 KB Output is correct
71 Correct 2 ms 336 KB Output is correct
72 Correct 3 ms 336 KB Output is correct
73 Correct 2 ms 336 KB Output is correct
74 Correct 2 ms 336 KB Output is correct
75 Correct 2 ms 336 KB Output is correct
76 Correct 0 ms 336 KB Output is correct
77 Correct 0 ms 336 KB Output is correct
78 Correct 2 ms 336 KB Output is correct
79 Correct 2 ms 336 KB Output is correct
80 Correct 3 ms 336 KB Output is correct
81 Correct 2 ms 336 KB Output is correct
82 Correct 2 ms 336 KB Output is correct
83 Correct 2 ms 336 KB Output is correct
84 Correct 0 ms 336 KB Output is correct
85 Correct 4 ms 336 KB Output is correct
86 Correct 15 ms 720 KB Output is correct
87 Correct 17 ms 720 KB Output is correct
88 Correct 17 ms 720 KB Output is correct
89 Correct 23 ms 720 KB Output is correct
90 Correct 17 ms 720 KB Output is correct
91 Correct 0 ms 336 KB Output is correct
92 Correct 1 ms 464 KB Output is correct
93 Correct 23 ms 720 KB Output is correct
94 Correct 22 ms 720 KB Output is correct
95 Correct 17 ms 720 KB Output is correct
96 Correct 17 ms 720 KB Output is correct
97 Correct 17 ms 720 KB Output is correct
98 Correct 0 ms 336 KB Output is correct
99 Correct 127 ms 47164 KB Output is correct
100 Correct 132 ms 47300 KB Output is correct
101 Correct 72 ms 47268 KB Output is correct
102 Correct 126 ms 47304 KB Output is correct
103 Correct 99 ms 47688 KB Output is correct
104 Correct 76 ms 47352 KB Output is correct
105 Correct 0 ms 336 KB Output is correct
106 Correct 73 ms 27640 KB Output is correct
107 Correct 134 ms 47136 KB Output is correct
108 Correct 78 ms 47216 KB Output is correct
109 Correct 109 ms 47176 KB Output is correct
110 Correct 99 ms 47676 KB Output is correct
111 Correct 68 ms 47644 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 158 ms 37652 KB Output is correct
4 Correct 943 ms 47300 KB Output is correct
5 Correct 626 ms 23968 KB Output is correct
6 Correct 892 ms 47204 KB Output is correct
7 Correct 777 ms 32396 KB Output is correct
8 Correct 1014 ms 47300 KB Output is correct
9 Incorrect 1 ms 336 KB Output isn't correct
10 Halted 0 ms 0 KB -