Submission #490807

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
490807	2021-11-29T10:21:01 Z	SeDunion	Rainforest Jumps (APIO21_jumps)	C++17	23 / 100	1358 ms	70028 KB

jumps

#include "jumps.h"

#include <vector>
#include <iostream>
#include <math.h>
#include <stack>
#include <cassert>

using namespace std;

const int LOG = 20;

int pl[int(3e5)], pr[int(3e5)];

int high[int(3e5)][LOG], low[int(3e5)][LOG];

int H[int(3e5)];

void init(int N, vector<int> a) {
	for (int &i : a) i--;
	for (int i = 0 ; i < N ; ++ i) H[i] = a[i];
	H[N] = N;
	stack<int>st;
	for (int i = 0 ; i < N ; ++ i) {
		while (st.size() && H[st.top()] < H[i]) st.pop();
		pl[H[i]] = st.size() ? H[st.top()] : N;
		st.push(i);
	}
	while (st.size()) st.pop();
	for (int i = N - 1 ; i >= 0 ; -- i) {
		while (st.size() && H[st.top()] < H[i]) st.pop();
		pr[H[i]] = st.size() ? H[st.top()] : N;
		st.push(i);
	}
	pl[N] = pr[N] = N;
	for (int i = 0 ; i <= N ; ++ i) {
		high[i][0] = max(pl[i], pr[i]);
		low[i][0] = pr[i];
		//low[i][0] = min(pl[i], pr[i]);
	}
	for (int j = 1 ; j < LOG ; ++ j) {
		for (int i = 0 ; i <= N ; ++ i) {
			{
				int where = high[i][j - 1];
				high[i][j] = high[where][j - 1];
			}
			{
				int where = low[i][j - 1];
				low[i][j] = low[where][j - 1];
			}
		}
	}
}

int minimum_jumps(int A, int B, int C, int D) {
	assert(A == B && C == D);
	int s = H[A], t = H[C];
	int ans = 0;
	for (int i = LOG - 1 ; i >= 0 ; -- i) {
		if (high[s][i] <= t) {
			ans += 1 << i;
			s = high[s][i];
		}
	}
	for (int i = LOG - 1 ; i >= 0 ; -- i) {
		if (low[s][i] <= t) {
			ans += 1 << i;
			s = low[s][i];
		}
	}
	if (s != t) return -1;
	return ans;
}

Subtask #1

0 / 4.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	328 KB	Output is correct
2	Correct	1 ms	200 KB	Output is correct
3	Runtime error	102 ms	56220 KB	Execution killed with signal 6
4	Halted	0 ms	0 KB	-

Subtask #2

0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	2 ms	456 KB	Execution killed with signal 6
2	Halted	0 ms	0 KB	-

Subtask #3

0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	2 ms	456 KB	Execution killed with signal 6
2	Halted	0 ms	0 KB	-

Subtask #4

0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	3 ms	456 KB	Execution killed with signal 6
2	Halted	0 ms	0 KB	-

Subtask #5

23.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	1 ms	200 KB	Output is correct
4	Correct	255 ms	16416 KB	Output is correct
5	Correct	1117 ms	35504 KB	Output is correct
6	Correct	736 ms	6052 KB	Output is correct
7	Correct	993 ms	35432 KB	Output is correct
8	Correct	687 ms	12396 KB	Output is correct
9	Correct	1086 ms	35428 KB	Output is correct
10	Correct	1358 ms	36276 KB	Output is correct
11	Correct	1227 ms	36256 KB	Output is correct
12	Correct	1294 ms	36140 KB	Output is correct
13	Correct	1238 ms	35480 KB	Output is correct
14	Correct	1235 ms	35836 KB	Output is correct
15	Correct	1228 ms	36280 KB	Output is correct
16	Correct	1300 ms	36364 KB	Output is correct
17	Correct	1 ms	200 KB	Output is correct
18	Correct	1 ms	200 KB	Output is correct
19	Correct	2 ms	200 KB	Output is correct
20	Correct	3 ms	328 KB	Output is correct
21	Correct	3 ms	328 KB	Output is correct
22	Correct	2 ms	328 KB	Output is correct
23	Correct	3 ms	328 KB	Output is correct
24	Correct	3 ms	328 KB	Output is correct
25	Correct	0 ms	328 KB	Output is correct
26	Correct	1 ms	328 KB	Output is correct
27	Correct	20 ms	584 KB	Output is correct
28	Correct	21 ms	584 KB	Output is correct
29	Correct	16 ms	584 KB	Output is correct
30	Correct	22 ms	584 KB	Output is correct
31	Correct	22 ms	584 KB	Output is correct
32	Correct	1 ms	200 KB	Output is correct
33	Correct	49 ms	20704 KB	Output is correct
34	Correct	108 ms	35480 KB	Output is correct
35	Correct	86 ms	36120 KB	Output is correct
36	Correct	91 ms	35504 KB	Output is correct
37	Correct	105 ms	35896 KB	Output is correct
38	Correct	103 ms	36248 KB	Output is correct

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	1 ms	200 KB	Output is correct
4	Correct	255 ms	16416 KB	Output is correct
5	Correct	1117 ms	35504 KB	Output is correct
6	Correct	736 ms	6052 KB	Output is correct
7	Correct	993 ms	35432 KB	Output is correct
8	Correct	687 ms	12396 KB	Output is correct
9	Correct	1086 ms	35428 KB	Output is correct
10	Correct	1358 ms	36276 KB	Output is correct
11	Correct	1227 ms	36256 KB	Output is correct
12	Correct	1294 ms	36140 KB	Output is correct
13	Correct	1238 ms	35480 KB	Output is correct
14	Correct	1235 ms	35836 KB	Output is correct
15	Correct	1228 ms	36280 KB	Output is correct
16	Correct	1300 ms	36364 KB	Output is correct
17	Correct	1 ms	200 KB	Output is correct
18	Correct	1 ms	200 KB	Output is correct
19	Correct	2 ms	200 KB	Output is correct
20	Correct	3 ms	328 KB	Output is correct
21	Correct	3 ms	328 KB	Output is correct
22	Correct	2 ms	328 KB	Output is correct
23	Correct	3 ms	328 KB	Output is correct
24	Correct	3 ms	328 KB	Output is correct
25	Correct	0 ms	328 KB	Output is correct
26	Correct	1 ms	328 KB	Output is correct
27	Correct	20 ms	584 KB	Output is correct
28	Correct	21 ms	584 KB	Output is correct
29	Correct	16 ms	584 KB	Output is correct
30	Correct	22 ms	584 KB	Output is correct
31	Correct	22 ms	584 KB	Output is correct
32	Correct	1 ms	200 KB	Output is correct
33	Correct	49 ms	20704 KB	Output is correct
34	Correct	108 ms	35480 KB	Output is correct
35	Correct	86 ms	36120 KB	Output is correct
36	Correct	91 ms	35504 KB	Output is correct
37	Correct	105 ms	35896 KB	Output is correct
38	Correct	103 ms	36248 KB	Output is correct
39	Correct	0 ms	200 KB	Output is correct
40	Correct	1 ms	200 KB	Output is correct
41	Correct	0 ms	200 KB	Output is correct
42	Correct	272 ms	16416 KB	Output is correct
43	Correct	863 ms	35476 KB	Output is correct
44	Correct	503 ms	6088 KB	Output is correct
45	Correct	1062 ms	35520 KB	Output is correct
46	Correct	612 ms	12448 KB	Output is correct
47	Correct	886 ms	35484 KB	Output is correct
48	Correct	1151 ms	36256 KB	Output is correct
49	Correct	1083 ms	36220 KB	Output is correct
50	Correct	1169 ms	36252 KB	Output is correct
51	Correct	1107 ms	35516 KB	Output is correct
52	Correct	1144 ms	35816 KB	Output is correct
53	Correct	846 ms	36252 KB	Output is correct
54	Correct	926 ms	36248 KB	Output is correct
55	Correct	0 ms	200 KB	Output is correct
56	Runtime error	116 ms	70028 KB	Execution killed with signal 6
57	Halted	0 ms	0 KB	-

Subtask #7

0 / 19.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	328 KB	Output is correct
2	Correct	1 ms	200 KB	Output is correct
3	Runtime error	102 ms	56220 KB	Execution killed with signal 6
4	Halted	0 ms	0 KB	-