oj.uz

Submission #559011

# Submission time Handle Problem Language Result Execution time Memory
559011 2022-05-09T07:41:03 Z LastRonin Rainforest Jumps (APIO21_jumps) C++14
44 / 100
 1208 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++;
	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(z[bp2[B][j]] <= D && B < C) {
			cnt += (1<<j);
			B = z[bp2[B][j]];
		}
	}
	return cnt;
}

Subtask #1
0 / 4.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 Incorrect 203 ms 37652 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 380 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 372 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Incorrect 3 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 0 ms 380 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 372 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Incorrect 3 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 1 ms 336 KB Output is correct
5 Correct 111 ms 38100 KB Output is correct
6 Correct 157 ms 47376 KB Output is correct
7 Correct 75 ms 24368 KB Output is correct
8 Correct 175 ms 47252 KB Output is correct
9 Correct 17 ms 7376 KB Output is correct
10 Correct 142 ms 47248 KB Output is correct
11 Incorrect 80 ms 47260 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 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 288 ms 21688 KB Output is correct
5 Correct 961 ms 47340 KB Output is correct
6 Correct 520 ms 8032 KB Output is correct
7 Correct 934 ms 47264 KB Output is correct
8 Correct 529 ms 16428 KB Output is correct
9 Correct 971 ms 47292 KB Output is correct
10 Correct 1208 ms 47312 KB Output is correct
11 Correct 1167 ms 47804 KB Output is correct
12 Correct 1108 ms 47292 KB Output is correct
13 Correct 1008 ms 47160 KB Output is correct
14 Correct 1087 ms 47668 KB Output is correct
15 Correct 930 ms 47412 KB Output is correct
16 Correct 847 ms 47332 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 2 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 3 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 19 ms 720 KB Output is correct
28 Correct 23 ms 720 KB Output is correct
29 Correct 21 ms 720 KB Output is correct
30 Correct 22 ms 720 KB Output is correct
31 Correct 21 ms 720 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 87 ms 27520 KB Output is correct
34 Correct 156 ms 47260 KB Output is correct
35 Correct 86 ms 47288 KB Output is correct
36 Correct 137 ms 47284 KB Output is correct
37 Correct 131 ms 47580 KB Output is correct
38 Correct 80 ms 47540 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 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 288 ms 21688 KB Output is correct
5 Correct 961 ms 47340 KB Output is correct
6 Correct 520 ms 8032 KB Output is correct
7 Correct 934 ms 47264 KB Output is correct
8 Correct 529 ms 16428 KB Output is correct
9 Correct 971 ms 47292 KB Output is correct
10 Correct 1208 ms 47312 KB Output is correct
11 Correct 1167 ms 47804 KB Output is correct
12 Correct 1108 ms 47292 KB Output is correct
13 Correct 1008 ms 47160 KB Output is correct
14 Correct 1087 ms 47668 KB Output is correct
15 Correct 930 ms 47412 KB Output is correct
16 Correct 847 ms 47332 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 2 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 3 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 19 ms 720 KB Output is correct
28 Correct 23 ms 720 KB Output is correct
29 Correct 21 ms 720 KB Output is correct
30 Correct 22 ms 720 KB Output is correct
31 Correct 21 ms 720 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 87 ms 27520 KB Output is correct
34 Correct 156 ms 47260 KB Output is correct
35 Correct 86 ms 47288 KB Output is correct
36 Correct 137 ms 47284 KB Output is correct
37 Correct 131 ms 47580 KB Output is correct
38 Correct 80 ms 47540 KB Output is correct
39 Correct 0 ms 336 KB Output is correct
40 Correct 0 ms 368 KB Output is correct
41 Correct 0 ms 336 KB Output is correct
42 Correct 243 ms 21796 KB Output is correct
43 Correct 1072 ms 47160 KB Output is correct
44 Correct 589 ms 8016 KB Output is correct
45 Correct 963 ms 47260 KB Output is correct
46 Correct 543 ms 16488 KB Output is correct
47 Correct 790 ms 47140 KB Output is correct
48 Correct 1067 ms 47256 KB Output is correct
49 Correct 957 ms 47780 KB Output is correct
50 Correct 1040 ms 47296 KB Output is correct
51 Correct 906 ms 47236 KB Output is correct
52 Correct 1024 ms 47688 KB Output is correct
53 Correct 815 ms 47300 KB Output is correct
54 Correct 858 ms 47276 KB Output is correct
55 Correct 0 ms 336 KB Output is correct
56 Correct 198 ms 47012 KB Output is correct
57 Correct 984 ms 47260 KB Output is correct
58 Correct 390 ms 8592 KB Output is correct
59 Correct 792 ms 47264 KB Output is correct
60 Correct 380 ms 17100 KB Output is correct
61 Correct 872 ms 47176 KB Output is correct
62 Correct 928 ms 47408 KB Output is correct
63 Correct 1098 ms 47520 KB Output is correct
64 Correct 865 ms 47308 KB Output is correct
65 Correct 782 ms 47176 KB Output is correct
66 Correct 945 ms 47592 KB Output is correct
67 Correct 691 ms 47676 KB Output is correct
68 Correct 730 ms 47264 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 1 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 2 ms 336 KB Output is correct
81 Correct 3 ms 336 KB Output is correct
82 Correct 2 ms 336 KB Output is correct
83 Correct 4 ms 336 KB Output is correct
84 Correct 1 ms 336 KB Output is correct
85 Correct 5 ms 336 KB Output is correct
86 Correct 9 ms 720 KB Output is correct
87 Correct 20 ms 720 KB Output is correct
88 Correct 19 ms 720 KB Output is correct
89 Correct 18 ms 720 KB Output is correct
90 Correct 20 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 19 ms 720 KB Output is correct
94 Correct 20 ms 720 KB Output is correct
95 Correct 18 ms 720 KB Output is correct
96 Correct 16 ms 720 KB Output is correct
97 Correct 16 ms 720 KB Output is correct
98 Correct 1 ms 208 KB Output is correct
99 Correct 134 ms 47136 KB Output is correct
100 Correct 134 ms 47136 KB Output is correct
101 Correct 70 ms 47416 KB Output is correct
102 Correct 111 ms 47156 KB Output is correct
103 Correct 102 ms 47688 KB Output is correct
104 Correct 73 ms 47412 KB Output is correct
105 Correct 0 ms 336 KB Output is correct
106 Correct 69 ms 27404 KB Output is correct
107 Correct 135 ms 47256 KB Output is correct
108 Correct 71 ms 47212 KB Output is correct
109 Correct 126 ms 47176 KB Output is correct
110 Correct 102 ms 47652 KB Output is correct
111 Correct 71 ms 47452 KB Output is correct

Subtask #7
0 / 19.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 Incorrect 203 ms 37652 KB Output isn't correct
4 Halted 0 ms 0 KB -