oj.uz

Submission #963608

# Submission time Handle Problem Language Result Execution time Memory
963608 2024-04-15T11:37:47 Z socpite Rainforest Jumps (APIO21_jumps) C++14
48 / 100
 846 ms 46672 KB 
#include<bits/stdc++.h>
using namespace std;

const int maxn = 2e5+5;
const int lg = 18;

int n;

int sp_left[lg][maxn], sp_both[lg][maxn], sp_right[lg][maxn];
int l[maxn], r[maxn];

void init(int N, vector<int> H){
	n = N;
    stack<int> stk;
    for(int i = 0; i < N; i++){
        while(!stk.empty() && H[stk.top()] < H[i])stk.pop();
        if(stk.empty())l[i] = sp_left[0][i] = -1;
        else l[i] = sp_left[0][i] = stk.top();
        stk.push(i);
    }
    while(!stk.empty())stk.pop();
    for(int i = N-1; i >= 0; i--){
        while(!stk.empty() && H[stk.top()] < H[i])stk.pop();
        if(stk.empty())r[i] = sp_right[0][i] = N;
        else r[i] = sp_right[0][i] = stk.top();
        stk.push(i);
        if(l[i] == -1 && r[i] == N)sp_both[0][i] = -1;
        else if(l[i] == -1 || (r[i] != N && H[r[i]] > H[l[i]]))sp_both[0][i] = r[i];
        else sp_both[0][i] = l[i];
    }
    for(int i = 1; i < lg; i++){
        for(int j = 0; j < N; j++){
            if(sp_left[i-1][j] == -1)sp_left[i][j] = -1;
            else sp_left[i][j] = sp_left[i-1][sp_left[i-1][j]];
            if(sp_both[i-1][j] == -1)sp_both[i][j] = -1;
            else sp_both[i][j] = sp_both[i-1][sp_both[i-1][j]];
            if(sp_right[i-1][j] == N)sp_right[i][j] = N;
            else sp_right[i][j] = sp_right[i-1][sp_right[i-1][j]];
        }
    }
}

int minimum_jumps(int A, int B, int C, int D){
    if(r[B] > D)return -1;
    for(int i = lg-1; i >= 0; i--){
        if(sp_left[i][B] < A || r[sp_left[i][B]] > D)continue;
		B = sp_left[i][B];
    }
	// r[B] <= D
	int res = 0;
	for(int i = lg-1; i >= 0; i--){
		if(sp_both[i][B] == -1 || r[sp_both[i][B]] > C)continue;
		// cout << i << " " << sp_both[i][B] << endl;
		res += (1<<i);
		B = sp_both[i][B];
	}
	for(int i = lg-1; i >= 0; i--){
		if(sp_right[i][B] == n || r[sp_right[i][B]] > C)continue;
		res += (1<<i);
		B = sp_right[i][B];
	}
	if(r[B] >= C)return res+1;
	// next move makes r[B] > C
	B = r[B];
	res++;
	if(r[B] <= D)return res+1;
	return -1;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 43352 KB Output is correct
2 Correct 5 ms 43352 KB Output is correct
3 Correct 100 ms 45864 KB Output is correct
4 Correct 805 ms 46552 KB Output is correct
5 Correct 648 ms 44884 KB Output is correct
6 Correct 755 ms 46524 KB Output is correct
7 Correct 582 ms 45524 KB Output is correct
8 Correct 736 ms 46552 KB Output is correct

Subtask #2
0 / 8.0

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

Subtask #3
0 / 13.0

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

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 43352 KB Output is correct
2 Correct 5 ms 43460 KB Output is correct
3 Correct 6 ms 43488 KB Output is correct
4 Correct 6 ms 43348 KB Output is correct
5 Correct 29 ms 45364 KB Output is correct
6 Correct 39 ms 45936 KB Output is correct
7 Correct 25 ms 44628 KB Output is correct
8 Correct 42 ms 45752 KB Output is correct
9 Correct 9 ms 43864 KB Output is correct
10 Correct 33 ms 45756 KB Output is correct
11 Correct 35 ms 46540 KB Output is correct
12 Correct 34 ms 46284 KB Output is correct
13 Incorrect 32 ms 46252 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 43352 KB Output is correct
2 Correct 5 ms 43352 KB Output is correct
3 Correct 5 ms 43352 KB Output is correct
4 Correct 169 ms 44444 KB Output is correct
5 Correct 646 ms 45756 KB Output is correct
6 Correct 455 ms 43840 KB Output is correct
7 Correct 638 ms 45716 KB Output is correct
8 Correct 388 ms 44236 KB Output is correct
9 Correct 708 ms 45756 KB Output is correct
10 Correct 813 ms 46524 KB Output is correct
11 Correct 716 ms 46524 KB Output is correct
12 Correct 776 ms 46516 KB Output is correct
13 Correct 698 ms 45768 KB Output is correct
14 Correct 772 ms 45952 KB Output is correct
15 Correct 622 ms 46524 KB Output is correct
16 Correct 576 ms 46552 KB Output is correct
17 Correct 5 ms 43352 KB Output is correct
18 Correct 5 ms 43352 KB Output is correct
19 Correct 6 ms 43352 KB Output is correct
20 Correct 7 ms 43352 KB Output is correct
21 Correct 6 ms 43352 KB Output is correct
22 Correct 6 ms 43352 KB Output is correct
23 Correct 6 ms 43352 KB Output is correct
24 Correct 7 ms 43352 KB Output is correct
25 Correct 5 ms 43352 KB Output is correct
26 Correct 5 ms 43604 KB Output is correct
27 Correct 15 ms 43352 KB Output is correct
28 Correct 15 ms 43352 KB Output is correct
29 Correct 17 ms 43604 KB Output is correct
30 Correct 18 ms 43604 KB Output is correct
31 Correct 12 ms 43352 KB Output is correct
32 Correct 5 ms 43352 KB Output is correct
33 Correct 20 ms 44652 KB Output is correct
34 Correct 32 ms 45768 KB Output is correct
35 Correct 29 ms 46544 KB Output is correct
36 Correct 36 ms 45760 KB Output is correct
37 Correct 32 ms 45972 KB Output is correct
38 Correct 38 ms 46628 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 43352 KB Output is correct
2 Correct 5 ms 43352 KB Output is correct
3 Correct 5 ms 43352 KB Output is correct
4 Correct 169 ms 44444 KB Output is correct
5 Correct 646 ms 45756 KB Output is correct
6 Correct 455 ms 43840 KB Output is correct
7 Correct 638 ms 45716 KB Output is correct
8 Correct 388 ms 44236 KB Output is correct
9 Correct 708 ms 45756 KB Output is correct
10 Correct 813 ms 46524 KB Output is correct
11 Correct 716 ms 46524 KB Output is correct
12 Correct 776 ms 46516 KB Output is correct
13 Correct 698 ms 45768 KB Output is correct
14 Correct 772 ms 45952 KB Output is correct
15 Correct 622 ms 46524 KB Output is correct
16 Correct 576 ms 46552 KB Output is correct
17 Correct 5 ms 43352 KB Output is correct
18 Correct 5 ms 43352 KB Output is correct
19 Correct 6 ms 43352 KB Output is correct
20 Correct 7 ms 43352 KB Output is correct
21 Correct 6 ms 43352 KB Output is correct
22 Correct 6 ms 43352 KB Output is correct
23 Correct 6 ms 43352 KB Output is correct
24 Correct 7 ms 43352 KB Output is correct
25 Correct 5 ms 43352 KB Output is correct
26 Correct 5 ms 43604 KB Output is correct
27 Correct 15 ms 43352 KB Output is correct
28 Correct 15 ms 43352 KB Output is correct
29 Correct 17 ms 43604 KB Output is correct
30 Correct 18 ms 43604 KB Output is correct
31 Correct 12 ms 43352 KB Output is correct
32 Correct 5 ms 43352 KB Output is correct
33 Correct 20 ms 44652 KB Output is correct
34 Correct 32 ms 45768 KB Output is correct
35 Correct 29 ms 46544 KB Output is correct
36 Correct 36 ms 45760 KB Output is correct
37 Correct 32 ms 45972 KB Output is correct
38 Correct 38 ms 46628 KB Output is correct
39 Correct 5 ms 43352 KB Output is correct
40 Correct 5 ms 43352 KB Output is correct
41 Correct 5 ms 43352 KB Output is correct
42 Correct 172 ms 44320 KB Output is correct
43 Correct 619 ms 45764 KB Output is correct
44 Correct 423 ms 43864 KB Output is correct
45 Correct 719 ms 45752 KB Output is correct
46 Correct 413 ms 44192 KB Output is correct
47 Correct 673 ms 45768 KB Output is correct
48 Correct 792 ms 46516 KB Output is correct
49 Correct 846 ms 46516 KB Output is correct
50 Correct 774 ms 46444 KB Output is correct
51 Correct 675 ms 45756 KB Output is correct
52 Correct 770 ms 45956 KB Output is correct
53 Correct 621 ms 46520 KB Output is correct
54 Correct 566 ms 46560 KB Output is correct
55 Correct 5 ms 43352 KB Output is correct
56 Correct 85 ms 45776 KB Output is correct
57 Correct 689 ms 45648 KB Output is correct
58 Correct 339 ms 43848 KB Output is correct
59 Correct 666 ms 45748 KB Output is correct
60 Correct 256 ms 44120 KB Output is correct
61 Correct 694 ms 45768 KB Output is correct
62 Correct 807 ms 46520 KB Output is correct
63 Correct 787 ms 46416 KB Output is correct
64 Correct 772 ms 46272 KB Output is correct
65 Correct 698 ms 45812 KB Output is correct
66 Correct 722 ms 46144 KB Output is correct
67 Correct 678 ms 46528 KB Output is correct
68 Correct 542 ms 46544 KB Output is correct
69 Correct 5 ms 43352 KB Output is correct
70 Correct 5 ms 43512 KB Output is correct
71 Correct 6 ms 43352 KB Output is correct
72 Correct 5 ms 43352 KB Output is correct
73 Correct 6 ms 43352 KB Output is correct
74 Correct 6 ms 43352 KB Output is correct
75 Correct 7 ms 43604 KB Output is correct
76 Correct 5 ms 43516 KB Output is correct
77 Correct 5 ms 43352 KB Output is correct
78 Correct 6 ms 43352 KB Output is correct
79 Correct 6 ms 43352 KB Output is correct
80 Correct 6 ms 43352 KB Output is correct
81 Correct 6 ms 43352 KB Output is correct
82 Correct 6 ms 43352 KB Output is correct
83 Correct 6 ms 43352 KB Output is correct
84 Correct 6 ms 43352 KB Output is correct
85 Correct 7 ms 43352 KB Output is correct
86 Correct 17 ms 43352 KB Output is correct
87 Correct 17 ms 43352 KB Output is correct
88 Correct 17 ms 43352 KB Output is correct
89 Correct 14 ms 43352 KB Output is correct
90 Correct 18 ms 43352 KB Output is correct
91 Correct 5 ms 43352 KB Output is correct
92 Correct 5 ms 43352 KB Output is correct
93 Correct 17 ms 43352 KB Output is correct
94 Correct 16 ms 43352 KB Output is correct
95 Correct 14 ms 43352 KB Output is correct
96 Correct 17 ms 43352 KB Output is correct
97 Correct 13 ms 43348 KB Output is correct
98 Correct 5 ms 43352 KB Output is correct
99 Correct 32 ms 45768 KB Output is correct
100 Correct 33 ms 45720 KB Output is correct
101 Correct 27 ms 46400 KB Output is correct
102 Correct 38 ms 45800 KB Output is correct
103 Correct 28 ms 45972 KB Output is correct
104 Correct 32 ms 46536 KB Output is correct
105 Correct 5 ms 43352 KB Output is correct
106 Correct 27 ms 44656 KB Output is correct
107 Correct 33 ms 45752 KB Output is correct
108 Correct 27 ms 46672 KB Output is correct
109 Correct 37 ms 46012 KB Output is correct
110 Correct 34 ms 45956 KB Output is correct
111 Correct 28 ms 46548 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 43352 KB Output is correct
2 Correct 5 ms 43352 KB Output is correct
3 Correct 100 ms 45864 KB Output is correct
4 Correct 805 ms 46552 KB Output is correct
5 Correct 648 ms 44884 KB Output is correct
6 Correct 755 ms 46524 KB Output is correct
7 Correct 582 ms 45524 KB Output is correct
8 Correct 736 ms 46552 KB Output is correct
9 Correct 5 ms 43352 KB Output is correct
10 Correct 5 ms 43352 KB Output is correct
11 Correct 5 ms 43352 KB Output is correct
12 Correct 6 ms 43352 KB Output is correct
13 Correct 5 ms 43352 KB Output is correct
14 Incorrect 6 ms 43348 KB Output isn't correct
15 Halted 0 ms 0 KB -