oj.uz

Submission #466532

# Submission time Handle Problem Language Result Execution time Memory
466532 2021-08-19T15:10:25 Z rainboy Rainforest Jumps (APIO21_jumps) C++17
33 / 100
 4000 ms 4144 KB 
#include "jumps.h"
#include <vector>

using namespace std;

const int N = 200000;

typedef vector<int> vi;

int max(int a, int b) { return a > b ? a : b; }

int ll[N], rr[N], qu[N], n;

void init(int n_, vi hh) {
	int i, cnt;

	n = n_;
	cnt = 0;
	for (i = 0; i < n; i++) {
		while (cnt && hh[qu[cnt - 1]] < hh[i])
			cnt--;
		ll[i] = cnt == 0 ? -1 : qu[cnt - 1];
		qu[cnt++] = i;
	}
	cnt = 0;
	for (i = n - 1; i >= 0; i--) {
		while (cnt && hh[qu[cnt - 1]] < hh[i])
			cnt--;
		rr[i] = cnt == 0 ? -1 : qu[cnt - 1];
		qu[cnt++] = i;
	}
}

int dd[N];

int minimum_jumps(int i1, int j1, int i2, int j2) {
	if (n > N)
		return i2 - j1;
	else {
		int head, cnt, i;

		for (i = 0; i < n; i++)
			dd[i] = n;
		head = cnt = 0;
		for (i = i1; i <= j1; i++)
			dd[i] = 0, qu[head + cnt++] = i;
		while (cnt) {
			int d;

			i = qu[cnt--, head++], d = dd[i] + 1;
			if (i2 <= i && i <= j2)
				return dd[i];
			if (ll[i] != -1 && dd[ll[i]] > d)
				dd[ll[i]] = d, qu[head + cnt++] = ll[i];
			if (rr[i] != -1 && dd[rr[i]] > d)
				dd[rr[i]] = d, qu[head + cnt++] = rr[i];
		}
		return -1;
	}
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Execution timed out 4053 ms 3348 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 0 ms 200 KB Output is correct
4 Correct 0 ms 200 KB Output is correct
5 Correct 1 ms 200 KB Output is correct
6 Correct 2 ms 200 KB Output is correct
7 Correct 2 ms 200 KB Output is correct
8 Correct 3 ms 200 KB Output is correct
9 Correct 1 ms 200 KB Output is correct
10 Correct 4 ms 200 KB Output is correct
11 Correct 3 ms 200 KB Output is correct
12 Correct 3 ms 200 KB Output is correct
13 Correct 2 ms 200 KB Output is correct
14 Correct 3 ms 200 KB Output is correct
15 Correct 4 ms 200 KB Output is correct
16 Correct 2 ms 200 KB Output is correct
17 Correct 3 ms 200 KB Output is correct
18 Correct 0 ms 200 KB Output is correct
19 Correct 0 ms 200 KB Output is correct
20 Correct 2 ms 200 KB Output is correct
21 Correct 3 ms 200 KB Output is correct
22 Correct 3 ms 200 KB Output is correct
23 Correct 3 ms 200 KB Output is correct
24 Correct 2 ms 200 KB Output is correct
25 Correct 0 ms 200 KB Output is correct
26 Correct 0 ms 200 KB Output is correct
27 Correct 2 ms 200 KB Output is correct
28 Correct 2 ms 200 KB Output is correct
29 Correct 2 ms 200 KB Output is correct
30 Correct 3 ms 200 KB Output is correct
31 Correct 2 ms 200 KB Output is correct
32 Correct 3 ms 200 KB Output is correct
33 Correct 0 ms 200 KB Output is correct
34 Correct 0 ms 200 KB Output is correct
35 Correct 1 ms 200 KB Output is correct
36 Correct 1 ms 200 KB Output is correct
37 Correct 0 ms 200 KB Output is correct
38 Correct 0 ms 200 KB Output is correct
39 Correct 0 ms 200 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 0 ms 200 KB Output is correct
4 Correct 0 ms 200 KB Output is correct
5 Correct 1 ms 200 KB Output is correct
6 Correct 2 ms 200 KB Output is correct
7 Correct 2 ms 200 KB Output is correct
8 Correct 3 ms 200 KB Output is correct
9 Correct 1 ms 200 KB Output is correct
10 Correct 4 ms 200 KB Output is correct
11 Correct 3 ms 200 KB Output is correct
12 Correct 3 ms 200 KB Output is correct
13 Correct 2 ms 200 KB Output is correct
14 Correct 3 ms 200 KB Output is correct
15 Correct 4 ms 200 KB Output is correct
16 Correct 2 ms 200 KB Output is correct
17 Correct 3 ms 200 KB Output is correct
18 Correct 0 ms 200 KB Output is correct
19 Correct 0 ms 200 KB Output is correct
20 Correct 2 ms 200 KB Output is correct
21 Correct 3 ms 200 KB Output is correct
22 Correct 3 ms 200 KB Output is correct
23 Correct 3 ms 200 KB Output is correct
24 Correct 2 ms 200 KB Output is correct
25 Correct 0 ms 200 KB Output is correct
26 Correct 0 ms 200 KB Output is correct
27 Correct 2 ms 200 KB Output is correct
28 Correct 2 ms 200 KB Output is correct
29 Correct 2 ms 200 KB Output is correct
30 Correct 3 ms 200 KB Output is correct
31 Correct 2 ms 200 KB Output is correct
32 Correct 3 ms 200 KB Output is correct
33 Correct 0 ms 200 KB Output is correct
34 Correct 0 ms 200 KB Output is correct
35 Correct 1 ms 200 KB Output is correct
36 Correct 1 ms 200 KB Output is correct
37 Correct 0 ms 200 KB Output is correct
38 Correct 0 ms 200 KB Output is correct
39 Correct 0 ms 200 KB Output is correct
40 Correct 0 ms 200 KB Output is correct
41 Correct 0 ms 200 KB Output is correct
42 Correct 0 ms 200 KB Output is correct
43 Correct 1 ms 200 KB Output is correct
44 Correct 2 ms 200 KB Output is correct
45 Correct 3 ms 200 KB Output is correct
46 Correct 1 ms 200 KB Output is correct
47 Correct 2 ms 200 KB Output is correct
48 Correct 2 ms 200 KB Output is correct
49 Correct 3 ms 200 KB Output is correct
50 Correct 3 ms 200 KB Output is correct
51 Correct 3 ms 200 KB Output is correct
52 Correct 3 ms 200 KB Output is correct
53 Correct 3 ms 200 KB Output is correct
54 Correct 3 ms 200 KB Output is correct
55 Correct 3 ms 200 KB Output is correct
56 Correct 3 ms 200 KB Output is correct
57 Correct 0 ms 200 KB Output is correct
58 Correct 22 ms 328 KB Output is correct
59 Correct 33 ms 328 KB Output is correct
60 Correct 7 ms 200 KB Output is correct
61 Correct 28 ms 328 KB Output is correct
62 Correct 14 ms 200 KB Output is correct
63 Correct 25 ms 328 KB Output is correct
64 Correct 35 ms 328 KB Output is correct
65 Correct 30 ms 328 KB Output is correct
66 Correct 35 ms 328 KB Output is correct
67 Correct 34 ms 328 KB Output is correct
68 Correct 37 ms 328 KB Output is correct
69 Correct 31 ms 328 KB Output is correct
70 Correct 28 ms 328 KB Output is correct
71 Correct 0 ms 200 KB Output is correct
72 Correct 1 ms 200 KB Output is correct
73 Correct 2 ms 200 KB Output is correct
74 Correct 3 ms 200 KB Output is correct
75 Correct 3 ms 200 KB Output is correct
76 Correct 2 ms 200 KB Output is correct
77 Correct 1 ms 200 KB Output is correct
78 Correct 1 ms 200 KB Output is correct
79 Correct 0 ms 200 KB Output is correct
80 Correct 2 ms 200 KB Output is correct
81 Correct 2 ms 200 KB Output is correct
82 Correct 3 ms 200 KB Output is correct
83 Correct 3 ms 200 KB Output is correct
84 Correct 2 ms 200 KB Output is correct
85 Correct 3 ms 200 KB Output is correct
86 Correct 0 ms 200 KB Output is correct
87 Correct 0 ms 200 KB Output is correct
88 Correct 1 ms 200 KB Output is correct
89 Correct 1 ms 200 KB Output is correct
90 Correct 0 ms 204 KB Output is correct
91 Correct 0 ms 204 KB Output is correct
92 Correct 0 ms 204 KB Output is correct
93 Correct 0 ms 200 KB Output is correct
94 Correct 5 ms 200 KB Output is correct
95 Correct 31 ms 328 KB Output is correct
96 Correct 33 ms 328 KB Output is correct
97 Correct 35 ms 340 KB Output is correct
98 Correct 38 ms 328 KB Output is correct
99 Correct 34 ms 328 KB Output is correct
100 Correct 0 ms 200 KB Output is correct
101 Correct 1 ms 200 KB Output is correct
102 Correct 25 ms 328 KB Output is correct
103 Correct 31 ms 328 KB Output is correct
104 Correct 25 ms 328 KB Output is correct
105 Correct 42 ms 328 KB Output is correct
106 Correct 29 ms 328 KB Output is correct
107 Correct 0 ms 200 KB Output is correct
108 Correct 1 ms 200 KB Output is correct
109 Correct 1 ms 328 KB Output is correct
110 Correct 1 ms 328 KB Output is correct
111 Correct 1 ms 344 KB Output is correct
112 Correct 1 ms 328 KB Output is correct
113 Correct 1 ms 328 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 0 ms 200 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Correct 28 ms 3092 KB Output is correct
6 Correct 48 ms 3584 KB Output is correct
7 Correct 21 ms 1856 KB Output is correct
8 Correct 37 ms 4144 KB Output is correct
9 Correct 5 ms 880 KB Output is correct
10 Correct 35 ms 3504 KB Output is correct
11 Correct 45 ms 4128 KB Output is correct
12 Correct 30 ms 3904 KB Output is correct
13 Correct 37 ms 3872 KB Output is correct
14 Correct 33 ms 3580 KB Output is correct
15 Correct 31 ms 4144 KB Output is correct
16 Correct 31 ms 4144 KB Output is correct
17 Correct 34 ms 4100 KB Output is correct
18 Correct 0 ms 200 KB Output is correct
19 Correct 0 ms 200 KB Output is correct
20 Correct 0 ms 200 KB Output is correct
21 Correct 1 ms 200 KB Output is correct
22 Correct 0 ms 200 KB Output is correct
23 Correct 1 ms 200 KB Output is correct
24 Correct 1 ms 200 KB Output is correct
25 Correct 1 ms 200 KB Output is correct
26 Correct 1 ms 200 KB Output is correct
27 Correct 1 ms 328 KB Output is correct
28 Correct 1 ms 328 KB Output is correct
29 Correct 1 ms 328 KB Output is correct
30 Correct 1 ms 328 KB Output is correct
31 Correct 1 ms 328 KB Output is correct
32 Correct 0 ms 200 KB Output is correct
33 Correct 45 ms 3308 KB Output is correct
34 Correct 35 ms 3712 KB Output is correct
35 Correct 32 ms 3904 KB Output is correct
36 Correct 36 ms 3456 KB Output is correct
37 Correct 36 ms 4112 KB Output is correct
38 Correct 30 ms 4100 KB Output is correct
39 Correct 1 ms 200 KB Output is correct
40 Correct 24 ms 2040 KB Output is correct
41 Correct 35 ms 3364 KB Output is correct
42 Correct 30 ms 4032 KB Output is correct
43 Correct 36 ms 3392 KB Output is correct
44 Correct 32 ms 4144 KB Output is correct
45 Correct 31 ms 4128 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 0 ms 200 KB Output is correct
4 Correct 1323 ms 1704 KB Output is correct
5 Execution timed out 4011 ms 3328 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 0 ms 200 KB Output is correct
4 Correct 1323 ms 1704 KB Output is correct
5 Execution timed out 4011 ms 3328 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Execution timed out 4053 ms 3348 KB Time limit exceeded
4 Halted 0 ms 0 KB -