Submission #490801

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
490801	2021-11-29T10:13:33 Z	SeDunion	Rainforest Jumps (APIO21_jumps)	C++17	23 / 100	1114 ms	69920 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] = 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] = max(high[where][j - 1], high[where][j - 1]);
			}
			{
				int where = low[i][j - 1];
				low[i][j] = min(low[where][j - 1], 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	0 ms	200 KB	Output is correct
2	Correct	1 ms	200 KB	Output is correct
3	Runtime error	93 ms	56272 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	444 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	444 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	2 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	0 ms	204 KB	Output is correct
3	Correct	0 ms	200 KB	Output is correct
4	Correct	250 ms	16320 KB	Output is correct
5	Correct	1028 ms	35500 KB	Output is correct
6	Correct	662 ms	6048 KB	Output is correct
7	Correct	1002 ms	35504 KB	Output is correct
8	Correct	536 ms	12356 KB	Output is correct
9	Correct	1000 ms	35560 KB	Output is correct
10	Correct	1114 ms	36272 KB	Output is correct
11	Correct	992 ms	36276 KB	Output is correct
12	Correct	855 ms	36140 KB	Output is correct
13	Correct	926 ms	35480 KB	Output is correct
14	Correct	858 ms	35852 KB	Output is correct
15	Correct	869 ms	36252 KB	Output is correct
16	Correct	929 ms	36256 KB	Output is correct
17	Correct	0 ms	200 KB	Output is correct
18	Correct	0 ms	200 KB	Output is correct
19	Correct	2 ms	200 KB	Output is correct
20	Correct	2 ms	328 KB	Output is correct
21	Correct	2 ms	328 KB	Output is correct
22	Correct	3 ms	328 KB	Output is correct
23	Correct	2 ms	328 KB	Output is correct
24	Correct	2 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	16 ms	584 KB	Output is correct
28	Correct	20 ms	684 KB	Output is correct
29	Correct	18 ms	584 KB	Output is correct
30	Correct	21 ms	584 KB	Output is correct
31	Correct	17 ms	584 KB	Output is correct
32	Correct	0 ms	200 KB	Output is correct
33	Correct	49 ms	20632 KB	Output is correct
34	Correct	94 ms	35516 KB	Output is correct
35	Correct	75 ms	36220 KB	Output is correct
36	Correct	104 ms	35588 KB	Output is correct
37	Correct	83 ms	35848 KB	Output is correct
38	Correct	76 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	0 ms	204 KB	Output is correct
3	Correct	0 ms	200 KB	Output is correct
4	Correct	250 ms	16320 KB	Output is correct
5	Correct	1028 ms	35500 KB	Output is correct
6	Correct	662 ms	6048 KB	Output is correct
7	Correct	1002 ms	35504 KB	Output is correct
8	Correct	536 ms	12356 KB	Output is correct
9	Correct	1000 ms	35560 KB	Output is correct
10	Correct	1114 ms	36272 KB	Output is correct
11	Correct	992 ms	36276 KB	Output is correct
12	Correct	855 ms	36140 KB	Output is correct
13	Correct	926 ms	35480 KB	Output is correct
14	Correct	858 ms	35852 KB	Output is correct
15	Correct	869 ms	36252 KB	Output is correct
16	Correct	929 ms	36256 KB	Output is correct
17	Correct	0 ms	200 KB	Output is correct
18	Correct	0 ms	200 KB	Output is correct
19	Correct	2 ms	200 KB	Output is correct
20	Correct	2 ms	328 KB	Output is correct
21	Correct	2 ms	328 KB	Output is correct
22	Correct	3 ms	328 KB	Output is correct
23	Correct	2 ms	328 KB	Output is correct
24	Correct	2 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	16 ms	584 KB	Output is correct
28	Correct	20 ms	684 KB	Output is correct
29	Correct	18 ms	584 KB	Output is correct
30	Correct	21 ms	584 KB	Output is correct
31	Correct	17 ms	584 KB	Output is correct
32	Correct	0 ms	200 KB	Output is correct
33	Correct	49 ms	20632 KB	Output is correct
34	Correct	94 ms	35516 KB	Output is correct
35	Correct	75 ms	36220 KB	Output is correct
36	Correct	104 ms	35588 KB	Output is correct
37	Correct	83 ms	35848 KB	Output is correct
38	Correct	76 ms	36248 KB	Output is correct
39	Correct	0 ms	200 KB	Output is correct
40	Correct	0 ms	328 KB	Output is correct
41	Correct	0 ms	200 KB	Output is correct
42	Correct	194 ms	16420 KB	Output is correct
43	Correct	911 ms	35472 KB	Output is correct
44	Correct	692 ms	6088 KB	Output is correct
45	Correct	919 ms	35628 KB	Output is correct
46	Correct	461 ms	12404 KB	Output is correct
47	Correct	871 ms	35520 KB	Output is correct
48	Correct	1049 ms	36288 KB	Output is correct
49	Correct	862 ms	36296 KB	Output is correct
50	Correct	975 ms	36160 KB	Output is correct
51	Correct	960 ms	35540 KB	Output is correct
52	Correct	809 ms	35820 KB	Output is correct
53	Correct	952 ms	36364 KB	Output is correct
54	Correct	943 ms	36272 KB	Output is correct
55	Correct	0 ms	200 KB	Output is correct
56	Runtime error	116 ms	69920 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	0 ms	200 KB	Output is correct
2	Correct	1 ms	200 KB	Output is correct
3	Runtime error	93 ms	56272 KB	Execution killed with signal 6
4	Halted	0 ms	0 KB	-