oj.uz

Submission #559008

# Submission time Handle Problem Language Result Execution time Memory
559008 2022-05-09T07:37:57 Z LastRonin Rainforest Jumps (APIO21_jumps) C++14
44 / 100
 1317 ms 47932 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++;
	ll X = B;
	for(int j = 17; j >= 0; j--) {
		if(bp2[X][j] == 0)continue;
		if(z[bp2[X][j]] < C) {
			X = z[bp2[X][j]];
		}
	}
	X = z[bp2[X][0]];	
	if(X > D || X == 0)return -1;
	C = X;
    ll Y = C;
    for(int j = 17; j >= 0; j--) { 
		if(bp2[Y][j] == 0)continue;
		if(z[bp2[Y][j]] <= D) {
			Y = z[bp2[Y][j]];
		}
    }
	D = Y;

	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 F = z[Le[B]];
	if(C <= z[Le[B]] && z[Le[B]] <= D) return 1;
	if(F >= A && z[Ri[F]] <= D && z[Ri[F]] >= C)return 1;
	ll cnt = 0;
	for(int j = 17; j >= 0; j--) {
		if(bp[B][j] == 0)continue;
		if(bp[B][j] <= h[D]) {
			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]];
		}
	}
	return cnt;
}

Subtask #1
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 Incorrect 182 ms 37664 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Incorrect 2 ms 336 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Incorrect 2 ms 336 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 121 ms 38100 KB Output is correct
6 Correct 149 ms 47192 KB Output is correct
7 Correct 65 ms 24376 KB Output is correct
8 Correct 146 ms 47260 KB Output is correct
9 Correct 17 ms 7312 KB Output is correct
10 Correct 149 ms 47160 KB Output is correct
11 Incorrect 97 ms 47288 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 227 ms 21832 KB Output is correct
5 Correct 1048 ms 47156 KB Output is correct
6 Correct 600 ms 8016 KB Output is correct
7 Correct 880 ms 47304 KB Output is correct
8 Correct 590 ms 16496 KB Output is correct
9 Correct 966 ms 47264 KB Output is correct
10 Correct 1151 ms 47228 KB Output is correct
11 Correct 1080 ms 47784 KB Output is correct
12 Correct 1155 ms 47292 KB Output is correct
13 Correct 919 ms 47144 KB Output is correct
14 Correct 1106 ms 47652 KB Output is correct
15 Correct 930 ms 47356 KB Output is correct
16 Correct 889 ms 47268 KB Output is correct
17 Correct 0 ms 336 KB Output is correct
18 Correct 0 ms 336 KB Output is correct
19 Correct 5 ms 336 KB Output is correct
20 Correct 2 ms 336 KB Output is correct
21 Correct 3 ms 336 KB Output is correct
22 Correct 3 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 1 ms 336 KB Output is correct
26 Correct 2 ms 464 KB Output is correct
27 Correct 18 ms 720 KB Output is correct
28 Correct 21 ms 720 KB Output is correct
29 Correct 20 ms 720 KB Output is correct
30 Correct 12 ms 720 KB Output is correct
31 Correct 26 ms 720 KB Output is correct
32 Correct 0 ms 336 KB Output is correct
33 Correct 80 ms 27424 KB Output is correct
34 Correct 163 ms 47264 KB Output is correct
35 Correct 109 ms 47268 KB Output is correct
36 Correct 121 ms 47260 KB Output is correct
37 Correct 113 ms 47588 KB Output is correct
38 Correct 104 ms 47496 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 227 ms 21832 KB Output is correct
5 Correct 1048 ms 47156 KB Output is correct
6 Correct 600 ms 8016 KB Output is correct
7 Correct 880 ms 47304 KB Output is correct
8 Correct 590 ms 16496 KB Output is correct
9 Correct 966 ms 47264 KB Output is correct
10 Correct 1151 ms 47228 KB Output is correct
11 Correct 1080 ms 47784 KB Output is correct
12 Correct 1155 ms 47292 KB Output is correct
13 Correct 919 ms 47144 KB Output is correct
14 Correct 1106 ms 47652 KB Output is correct
15 Correct 930 ms 47356 KB Output is correct
16 Correct 889 ms 47268 KB Output is correct
17 Correct 0 ms 336 KB Output is correct
18 Correct 0 ms 336 KB Output is correct
19 Correct 5 ms 336 KB Output is correct
20 Correct 2 ms 336 KB Output is correct
21 Correct 3 ms 336 KB Output is correct
22 Correct 3 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 1 ms 336 KB Output is correct
26 Correct 2 ms 464 KB Output is correct
27 Correct 18 ms 720 KB Output is correct
28 Correct 21 ms 720 KB Output is correct
29 Correct 20 ms 720 KB Output is correct
30 Correct 12 ms 720 KB Output is correct
31 Correct 26 ms 720 KB Output is correct
32 Correct 0 ms 336 KB Output is correct
33 Correct 80 ms 27424 KB Output is correct
34 Correct 163 ms 47264 KB Output is correct
35 Correct 109 ms 47268 KB Output is correct
36 Correct 121 ms 47260 KB Output is correct
37 Correct 113 ms 47588 KB Output is correct
38 Correct 104 ms 47496 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 298 ms 21796 KB Output is correct
43 Correct 1004 ms 47264 KB Output is correct
44 Correct 726 ms 8076 KB Output is correct
45 Correct 1101 ms 47284 KB Output is correct
46 Correct 512 ms 16492 KB Output is correct
47 Correct 1065 ms 47268 KB Output is correct
48 Correct 1198 ms 47288 KB Output is correct
49 Correct 1227 ms 47932 KB Output is correct
50 Correct 1070 ms 47224 KB Output is correct
51 Correct 1038 ms 47260 KB Output is correct
52 Correct 1084 ms 47560 KB Output is correct
53 Correct 1022 ms 47408 KB Output is correct
54 Correct 994 ms 47308 KB Output is correct
55 Correct 1 ms 336 KB Output is correct
56 Correct 236 ms 47000 KB Output is correct
57 Correct 1018 ms 47224 KB Output is correct
58 Correct 525 ms 8608 KB Output is correct
59 Correct 834 ms 47256 KB Output is correct
60 Correct 422 ms 17004 KB Output is correct
61 Correct 1084 ms 47264 KB Output is correct
62 Correct 1268 ms 47232 KB Output is correct
63 Correct 1227 ms 47548 KB Output is correct
64 Correct 1317 ms 47420 KB Output is correct
65 Correct 884 ms 47160 KB Output is correct
66 Correct 1216 ms 47676 KB Output is correct
67 Correct 810 ms 47672 KB Output is correct
68 Correct 1028 ms 47260 KB Output is correct
69 Correct 0 ms 384 KB Output is correct
70 Correct 1 ms 372 KB Output is correct
71 Correct 3 ms 336 KB Output is correct
72 Correct 3 ms 336 KB Output is correct
73 Correct 3 ms 384 KB Output is correct
74 Correct 2 ms 372 KB Output is correct
75 Correct 2 ms 384 KB Output is correct
76 Correct 0 ms 336 KB Output is correct
77 Correct 1 ms 336 KB Output is correct
78 Correct 3 ms 336 KB Output is correct
79 Correct 4 ms 336 KB Output is correct
80 Correct 2 ms 336 KB Output is correct
81 Correct 2 ms 336 KB Output is correct
82 Correct 4 ms 336 KB Output is correct
83 Correct 2 ms 336 KB Output is correct
84 Correct 1 ms 336 KB Output is correct
85 Correct 6 ms 336 KB Output is correct
86 Correct 24 ms 720 KB Output is correct
87 Correct 25 ms 720 KB Output is correct
88 Correct 21 ms 720 KB Output is correct
89 Correct 20 ms 768 KB Output is correct
90 Correct 14 ms 720 KB Output is correct
91 Correct 1 ms 336 KB Output is correct
92 Correct 1 ms 464 KB Output is correct
93 Correct 21 ms 768 KB Output is correct
94 Correct 20 ms 768 KB Output is correct
95 Correct 18 ms 720 KB Output is correct
96 Correct 26 ms 720 KB Output is correct
97 Correct 17 ms 720 KB Output is correct
98 Correct 1 ms 336 KB Output is correct
99 Correct 160 ms 47184 KB Output is correct
100 Correct 171 ms 47156 KB Output is correct
101 Correct 106 ms 47296 KB Output is correct
102 Correct 145 ms 47268 KB Output is correct
103 Correct 131 ms 47592 KB Output is correct
104 Correct 99 ms 47468 KB Output is correct
105 Correct 0 ms 336 KB Output is correct
106 Correct 92 ms 27540 KB Output is correct
107 Correct 143 ms 47260 KB Output is correct
108 Correct 101 ms 47268 KB Output is correct
109 Correct 137 ms 47176 KB Output is correct
110 Correct 142 ms 47672 KB Output is correct
111 Correct 89 ms 47536 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 Incorrect 182 ms 37664 KB Output isn't correct
4 Halted 0 ms 0 KB -