oj.uz

Submission #558982

# Submission time Handle Problem Language Result Execution time Memory
558982 2022-05-09T06:37:08 Z LastRonin Rainforest Jumps (APIO21_jumps) C++14
27 / 100
 1099 ms 64952 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;

ll bp[N][18];
ll bp2[N][18];
ll z[N], h[N];
ll 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]];
		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];
		}
	}	
}

int minimum_jumps(int A, int B, int C, int D) {
	A++, B++, C++, D++;
	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 1 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 224 ms 50744 KB Output is correct
4 Correct 1072 ms 63636 KB Output is correct
5 Correct 774 ms 32244 KB Output is correct
6 Correct 892 ms 63636 KB Output is correct
7 Correct 761 ms 43592 KB Output is correct
8 Correct 992 ms 63716 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 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 0 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 0 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 291 ms 29664 KB Output is correct
5 Correct 977 ms 64524 KB Output is correct
6 Correct 642 ms 10836 KB Output is correct
7 Correct 949 ms 64484 KB Output is correct
8 Correct 462 ms 22352 KB Output is correct
9 Correct 930 ms 64472 KB Output is correct
10 Correct 986 ms 63680 KB Output is correct
11 Correct 1055 ms 64888 KB Output is correct
12 Correct 1004 ms 63736 KB Output is correct
13 Correct 786 ms 64484 KB Output is correct
14 Correct 967 ms 64808 KB Output is correct
15 Correct 936 ms 63908 KB Output is correct
16 Correct 963 ms 63832 KB Output is correct
17 Correct 0 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 3 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 11 ms 976 KB Output is correct
28 Correct 18 ms 976 KB Output is correct
29 Correct 13 ms 976 KB Output is correct
30 Correct 25 ms 976 KB Output is correct
31 Correct 16 ms 976 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 71 ms 37400 KB Output is correct
34 Correct 153 ms 64448 KB Output is correct
35 Correct 108 ms 63800 KB Output is correct
36 Correct 124 ms 64468 KB Output is correct
37 Correct 136 ms 64864 KB Output is correct
38 Correct 81 ms 64176 KB Output is correct

Subtask #6
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 1 ms 336 KB Output is correct
4 Correct 291 ms 29664 KB Output is correct
5 Correct 977 ms 64524 KB Output is correct
6 Correct 642 ms 10836 KB Output is correct
7 Correct 949 ms 64484 KB Output is correct
8 Correct 462 ms 22352 KB Output is correct
9 Correct 930 ms 64472 KB Output is correct
10 Correct 986 ms 63680 KB Output is correct
11 Correct 1055 ms 64888 KB Output is correct
12 Correct 1004 ms 63736 KB Output is correct
13 Correct 786 ms 64484 KB Output is correct
14 Correct 967 ms 64808 KB Output is correct
15 Correct 936 ms 63908 KB Output is correct
16 Correct 963 ms 63832 KB Output is correct
17 Correct 0 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 3 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 11 ms 976 KB Output is correct
28 Correct 18 ms 976 KB Output is correct
29 Correct 13 ms 976 KB Output is correct
30 Correct 25 ms 976 KB Output is correct
31 Correct 16 ms 976 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 71 ms 37400 KB Output is correct
34 Correct 153 ms 64448 KB Output is correct
35 Correct 108 ms 63800 KB Output is correct
36 Correct 124 ms 64468 KB Output is correct
37 Correct 136 ms 64864 KB Output is correct
38 Correct 81 ms 64176 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 266 ms 29660 KB Output is correct
43 Correct 916 ms 64456 KB Output is correct
44 Correct 622 ms 10832 KB Output is correct
45 Correct 902 ms 64484 KB Output is correct
46 Correct 550 ms 22352 KB Output is correct
47 Correct 755 ms 64420 KB Output is correct
48 Correct 1000 ms 63780 KB Output is correct
49 Correct 969 ms 64952 KB Output is correct
50 Correct 1099 ms 63816 KB Output is correct
51 Correct 790 ms 64488 KB Output is correct
52 Correct 1059 ms 64804 KB Output is correct
53 Correct 709 ms 63948 KB Output is correct
54 Correct 801 ms 63816 KB Output is correct
55 Correct 0 ms 336 KB Output is correct
56 Incorrect 192 ms 64236 KB Output isn't correct
57 Halted 0 ms 0 KB -

Subtask #7
0 / 19.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 224 ms 50744 KB Output is correct
4 Correct 1072 ms 63636 KB Output is correct
5 Correct 774 ms 32244 KB Output is correct
6 Correct 892 ms 63636 KB Output is correct
7 Correct 761 ms 43592 KB Output is correct
8 Correct 992 ms 63716 KB Output is correct
9 Incorrect 0 ms 336 KB Output isn't correct
10 Halted 0 ms 0 KB -