oj.uz

Submission #466634

# Submission time Handle Problem Language Result Execution time Memory
466634 2021-08-19T19:32:41 Z rainboy Rainforest Jumps (APIO21_jumps) C++17
48 / 100
 1412 ms 22212 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 aa[N], qu[N];
int ddp[N], pp[N], pp_[N];
int ddq[N], qq[N], qq_[N];
int ddl[N], ll[N], ll_[N];
int ddr[N], rr[N], rr_[N];
int n;

void dfs(int *dd, int *pp, int *pp_, int i) {
	if (dd[i])
		return;
	if (pp[i] == -1)
		dd[i] = 1, pp_[i] = -1;
	else {
		int p, p_;

		dfs(dd, pp, pp_, pp[i]);
		p = pp[i], p_ = pp_[p];
		dd[i] = dd[p] + 1, pp_[i] = dd[p] - dd[pp_[p]] != dd[p_] - dd[pp_[p_]] ? p : pp_[p_];
	}
}

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

	n = n_;
	for (i = 0; i < n; i++)
		aa[i] = aa_[i];
	cnt = 0;
	for (i = 0; i < n; i++) {
		while (cnt && aa[qu[cnt - 1]] < aa[i])
			cnt--;
		ll[i] = cnt == 0 ? -1 : qu[cnt - 1];
		qu[cnt++] = i;
	}
	cnt = 0;
	for (i = n - 1; i >= 0; i--) {
		while (cnt && aa[qu[cnt - 1]] < aa[i])
			cnt--;
		rr[i] = cnt == 0 ? -1 : qu[cnt - 1];
		qu[cnt++] = i;
	}
	for (i = 0; i < n; i++) {
		pp[i] = ll[i] == -1 || rr[i] == -1 ? (ll[i] == -1 ? rr[i] : ll[i]) : (aa[ll[i]] < aa[rr[i]] ? ll[i] : rr[i]);
		qq[i] = ll[i] == -1 || rr[i] == -1 ? (ll[i] == -1 ? rr[i] : ll[i]) : (aa[ll[i]] > aa[rr[i]] ? ll[i] : rr[i]);
	}
	for (i = 0; i < n; i++) {
		dfs(ddp, pp, pp_, i);
		dfs(ddq, qq, qq_, i);
		dfs(ddl, ll, ll_, i);
		dfs(ddr, rr, rr_, i);
	}
}

int minimum_jumps(int w, int x, int y, int z) {
	int i, j, k, a;

	j = y;
	while (1)
		if (rr_[j] != -1 && rr_[j] <= z)
			j = rr_[j];
		else if (rr[j] != -1 && rr[j] <= z)
			j = rr[j];
		else
			break;
	i = x;
	while (1)
		if (ll_[i] != -1 && ll_[i] >= w && aa[ll_[i]] < aa[j])
			i = ll_[i];
		else if (ll[i] != -1 && ll[i] >= w && aa[ll[i]] < aa[j])
			i = ll[i];
		else
			break;
	if (aa[i] > aa[j])
		return -1;
	a = -1;
	if (x + 1 < y) {
		k = x + 1;
		while (1)
			if (rr_[k] != -1 && rr_[k] < y)
				k = rr_[k];
			else if (rr[k] != -1 && rr[k] < y)
				k = rr[k];
			else
				break;
		a = aa[k];
	}
	if (a > aa[j])
		return -1;
	k = 0;
	while (1)
		if (qq_[i] != -1 && aa[qq_[i]] <= a)
			k += ddq[i] - ddq[qq_[i]], i = qq_[i];
		else if (qq[i] != -1 && aa[qq[i]] <= a)
			k++, i = qq[i];
		else
			break;
	if (qq[i] != -1 && aa[qq[i]] <= aa[j])
		return k + (qq[i] >= y ? 1 : 2);
	while (1)
		if (pp_[i] != -1 && aa[pp_[i]] <= a)
			k += ddp[i] - ddp[pp_[i]], i = pp_[i];
		else if (pp[i] != -1 && aa[pp[i]] <= a)
			k++, i = pp[i];
		else
			break;
	if (pp[i] != -1 && aa[pp[i]] <= aa[j])
		return k + (pp[i] >= y ? 1 : 2);
	return -1;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 155 ms 17688 KB Output is correct
4 Correct 1037 ms 22124 KB Output is correct
5 Correct 869 ms 11328 KB Output is correct
6 Correct 1228 ms 22152 KB Output is correct
7 Correct 971 ms 15168 KB Output is correct
8 Correct 1229 ms 22100 KB Output is correct

Subtask #2
0 / 8.0

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

Subtask #3
0 / 13.0

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

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 0 ms 328 KB Output is correct
4 Correct 0 ms 328 KB Output is correct
5 Correct 42 ms 9664 KB Output is correct
6 Correct 49 ms 11924 KB Output is correct
7 Correct 24 ms 6328 KB Output is correct
8 Correct 49 ms 11972 KB Output is correct
9 Correct 8 ms 2064 KB Output is correct
10 Correct 48 ms 11924 KB Output is correct
11 Correct 54 ms 22212 KB Output is correct
12 Correct 47 ms 17984 KB Output is correct
13 Correct 49 ms 19092 KB Output is correct
14 Correct 49 ms 11924 KB Output is correct
15 Incorrect 41 ms 12328 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 0 ms 328 KB Output is correct
4 Correct 170 ms 5636 KB Output is correct
5 Correct 1010 ms 12040 KB Output is correct
6 Correct 663 ms 2248 KB Output is correct
7 Correct 994 ms 11932 KB Output is correct
8 Correct 639 ms 4380 KB Output is correct
9 Correct 998 ms 11968 KB Output is correct
10 Correct 1059 ms 22064 KB Output is correct
11 Correct 1010 ms 20488 KB Output is correct
12 Correct 1173 ms 20672 KB Output is correct
13 Correct 1098 ms 11968 KB Output is correct
14 Correct 1182 ms 12352 KB Output is correct
15 Correct 1075 ms 12736 KB Output is correct
16 Correct 985 ms 12736 KB Output is correct
17 Correct 0 ms 328 KB Output is correct
18 Correct 0 ms 328 KB Output is correct
19 Correct 2 ms 328 KB Output is correct
20 Correct 3 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 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 18 ms 456 KB Output is correct
28 Correct 20 ms 456 KB Output is correct
29 Correct 14 ms 456 KB Output is correct
30 Correct 26 ms 456 KB Output is correct
31 Correct 19 ms 456 KB Output is correct
32 Correct 0 ms 328 KB Output is correct
33 Correct 27 ms 7064 KB Output is correct
34 Correct 51 ms 11968 KB Output is correct
35 Correct 48 ms 20516 KB Output is correct
36 Correct 47 ms 11968 KB Output is correct
37 Correct 41 ms 12328 KB Output is correct
38 Correct 38 ms 12688 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 0 ms 328 KB Output is correct
4 Correct 170 ms 5636 KB Output is correct
5 Correct 1010 ms 12040 KB Output is correct
6 Correct 663 ms 2248 KB Output is correct
7 Correct 994 ms 11932 KB Output is correct
8 Correct 639 ms 4380 KB Output is correct
9 Correct 998 ms 11968 KB Output is correct
10 Correct 1059 ms 22064 KB Output is correct
11 Correct 1010 ms 20488 KB Output is correct
12 Correct 1173 ms 20672 KB Output is correct
13 Correct 1098 ms 11968 KB Output is correct
14 Correct 1182 ms 12352 KB Output is correct
15 Correct 1075 ms 12736 KB Output is correct
16 Correct 985 ms 12736 KB Output is correct
17 Correct 0 ms 328 KB Output is correct
18 Correct 0 ms 328 KB Output is correct
19 Correct 2 ms 328 KB Output is correct
20 Correct 3 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 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 18 ms 456 KB Output is correct
28 Correct 20 ms 456 KB Output is correct
29 Correct 14 ms 456 KB Output is correct
30 Correct 26 ms 456 KB Output is correct
31 Correct 19 ms 456 KB Output is correct
32 Correct 0 ms 328 KB Output is correct
33 Correct 27 ms 7064 KB Output is correct
34 Correct 51 ms 11968 KB Output is correct
35 Correct 48 ms 20516 KB Output is correct
36 Correct 47 ms 11968 KB Output is correct
37 Correct 41 ms 12328 KB Output is correct
38 Correct 38 ms 12688 KB Output is correct
39 Correct 0 ms 328 KB Output is correct
40 Correct 0 ms 328 KB Output is correct
41 Correct 1 ms 328 KB Output is correct
42 Correct 254 ms 5640 KB Output is correct
43 Correct 1156 ms 11968 KB Output is correct
44 Correct 679 ms 2248 KB Output is correct
45 Correct 986 ms 11968 KB Output is correct
46 Correct 590 ms 4288 KB Output is correct
47 Correct 777 ms 11912 KB Output is correct
48 Correct 1095 ms 22080 KB Output is correct
49 Correct 1155 ms 20520 KB Output is correct
50 Correct 1229 ms 20744 KB Output is correct
51 Correct 917 ms 11900 KB Output is correct
52 Correct 1120 ms 12308 KB Output is correct
53 Correct 1107 ms 12696 KB Output is correct
54 Correct 1012 ms 12736 KB Output is correct
55 Correct 0 ms 328 KB Output is correct
56 Correct 115 ms 11932 KB Output is correct
57 Correct 1049 ms 11904 KB Output is correct
58 Correct 503 ms 2484 KB Output is correct
59 Correct 967 ms 11968 KB Output is correct
60 Correct 401 ms 4496 KB Output is correct
61 Correct 851 ms 11920 KB Output is correct
62 Correct 890 ms 22080 KB Output is correct
63 Correct 1412 ms 18240 KB Output is correct
64 Correct 1274 ms 16912 KB Output is correct
65 Correct 1148 ms 11952 KB Output is correct
66 Correct 1206 ms 12352 KB Output is correct
67 Correct 1081 ms 12716 KB Output is correct
68 Correct 973 ms 12724 KB Output is correct
69 Correct 0 ms 328 KB Output is correct
70 Correct 1 ms 328 KB Output is correct
71 Correct 3 ms 328 KB Output is correct
72 Correct 2 ms 328 KB Output is correct
73 Correct 2 ms 328 KB Output is correct
74 Correct 2 ms 328 KB Output is correct
75 Correct 3 ms 328 KB Output is correct
76 Correct 0 ms 328 KB Output is correct
77 Correct 0 ms 328 KB Output is correct
78 Correct 2 ms 328 KB Output is correct
79 Correct 2 ms 328 KB Output is correct
80 Correct 2 ms 328 KB Output is correct
81 Correct 3 ms 328 KB Output is correct
82 Correct 3 ms 328 KB Output is correct
83 Correct 2 ms 328 KB Output is correct
84 Correct 0 ms 328 KB Output is correct
85 Correct 4 ms 328 KB Output is correct
86 Correct 25 ms 456 KB Output is correct
87 Correct 19 ms 456 KB Output is correct
88 Correct 23 ms 456 KB Output is correct
89 Correct 19 ms 456 KB Output is correct
90 Correct 24 ms 456 KB Output is correct
91 Correct 1 ms 328 KB Output is correct
92 Correct 1 ms 328 KB Output is correct
93 Correct 17 ms 456 KB Output is correct
94 Correct 17 ms 456 KB Output is correct
95 Correct 19 ms 456 KB Output is correct
96 Correct 23 ms 456 KB Output is correct
97 Correct 18 ms 456 KB Output is correct
98 Correct 0 ms 328 KB Output is correct
99 Correct 50 ms 11936 KB Output is correct
100 Correct 49 ms 11908 KB Output is correct
101 Correct 47 ms 19648 KB Output is correct
102 Correct 49 ms 11892 KB Output is correct
103 Correct 41 ms 12296 KB Output is correct
104 Correct 38 ms 12684 KB Output is correct
105 Correct 0 ms 328 KB Output is correct
106 Correct 28 ms 7012 KB Output is correct
107 Correct 49 ms 11996 KB Output is correct
108 Correct 51 ms 20536 KB Output is correct
109 Correct 63 ms 11928 KB Output is correct
110 Correct 40 ms 12308 KB Output is correct
111 Correct 38 ms 12736 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 155 ms 17688 KB Output is correct
4 Correct 1037 ms 22124 KB Output is correct
5 Correct 869 ms 11328 KB Output is correct
6 Correct 1228 ms 22152 KB Output is correct
7 Correct 971 ms 15168 KB Output is correct
8 Correct 1229 ms 22100 KB Output is correct
9 Correct 0 ms 328 KB Output is correct
10 Correct 0 ms 328 KB Output is correct
11 Correct 0 ms 328 KB Output is correct
12 Correct 1 ms 328 KB Output is correct
13 Correct 2 ms 328 KB Output is correct
14 Incorrect 3 ms 328 KB Output isn't correct
15 Halted 0 ms 0 KB -