oj.uz

Submission #972263

# Submission time Handle Problem Language Result Execution time Memory
972263 2024-04-30T10:11:37 Z dubabuba Rainforest Jumps (APIO21_jumps) C++14
44 / 100
 887 ms 70480 KB 
#include <bits/stdc++.h>
#include "jumps.h"

using namespace std;

template<typename T> void ono_min(T &MIN, T CMP) { if(MIN > CMP) MIN = CMP; }
template<typename T> void ono_max(T &MAX, T CMP) { if(MAX < CMP) MAX = CMP; }

typedef pair<int, int> pii;
#define ff first
#define ss second
#define MP make_pair

const int mxk = 32;
const int mxn = 2e5 + 10;
int L[mxn], R[mxn], n;
vector<int> adj[mxn];
int dis[mxn], h[mxn];

int mx[mxk][mxn];
int mn[mxk][mxn];
pii ll[mxk][mxn];

bool mx_valid(int k, int i) { return 1 <= mx[k][i] && mx[k][i] <= n; }
bool mn_valid(int k, int i) { return 1 <= mn[k][i] && mn[k][i] <= n; }
int solve(int s, int f);

void init(int N, vector<int> H) {
	memset(L, -1, sizeof L);
	memset(R, -1, sizeof R);
	n = N;

	stack<int> st; st.push(0);
	for(int i = 1; i < N; i++) {
		while(st.size() && H[st.top()] <= H[i])
			st.pop();
		if(st.size())
			L[i] = st.top();
		st.push(i);
	}

	stack<int> en; en.push(0);
	for(int i = N - 1; i >= 0; i--) {
		while(en.size() && H[en.top()] <= H[i])
			en.pop();
		if(en.size())
			R[i] = en.top();
		en.push(i);
	}

	for(int i = 0; i < N; i++) {
		h[i] = H[i];
		if(L[i] > -1) {
			adj[i].push_back(L[i]);
			if(mn[0][H[i]] == 0)
				mn[0][H[i]] = H[L[i]];
			ono_min(mn[0][H[i]], H[L[i]]);
			ono_max(mx[0][H[i]], H[L[i]]);
			ll[0][i] = MP(H[L[i]], L[i]);
		}
		if(R[i] > -1) {
			adj[i].push_back(R[i]);
			if(mn[0][H[i]] == 0)
				mn[0][H[i]] = H[R[i]];
			ono_min(mn[0][H[i]], H[R[i]]);
			ono_max(mx[0][H[i]], H[R[i]]);
		}
	}

	for(int k = 1; k < mxk; k++)
	for(int i = 1; i <= n; i++) {
		int mnj = mn[k - 1][i];
		int mxj = mx[k - 1][i];

		if(mnj) mn[k][i] = mn[k - 1][mnj];
		if(mxj) mx[k][i] = mx[k - 1][mxj];
	}

	for(int k = 1; k < mxk; k++)
	for(int i = 0; i < n; i++) {
		pii p = ll[k - 1][i];
		if(p.ss) ll[k][i] = ll[k - 1][p.ss];
	}

	// for(int i = 0; i < n; i++) {
	// 	for(int k = 0; (1 << k) <= n; k++)
	// 		cout << i << ' ' << k << ": " << ll[k][i].ff << ' ' << ll[k][i].ss << endl;
	// }

	// cout << endl;
	// for(int i = 1; i < n; i++)
	// for(int j = i + 1; j <= n; j++)
	// 	cout << i << ' ' << j << " = " << solve(i, j) << endl;
}

int solve(int s, int f) {
	int ans = 0;
	for(int k = mxk - 1; k >= 0; k--)
	if(mx[k][s] && mx[k][s] <= f) {
		s = mx[k][s];
		ans += (1 << k);
	}

	for(int k = mxk - 1; k >= 0; k--)
	if(mn[k][s] && mn[k][s] <= f) {
		s = mn[k][s];
		ans += (1 << k);
	}
	if(s == f) return ans;
	return -1;
}

int minimum_jumps(int A, int B, int C, int D) {
	if(C != D) exit(1);
	if(h[B] > h[C]) return -1;
	if(A == B) return solve(h[A], h[C]);

	// cout << "sussy\n";
	// cout << A << ' ' << B << endl;
	int cur = B;
	for(int i = mxk - 1; i >= 0; i--) {
		int hi = ll[i][cur].ff;
		int id = ll[i][cur].ss;
		if(hi == 0) continue;
		if(hi >= h[D]) continue;
		if(id < A) continue;
		cur = id;
		// cout << cur << ' ';
	}

	// cout << cur << ' ' << h[cur] << endl;
	if(h[cur] > h[C]) return -1;
	return solve(h[cur], h[C]);
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9816 KB Output is correct
2 Correct 2 ms 9816 KB Output is correct
3 Runtime error 37 ms 41884 KB Execution failed because the return code was nonzero
4 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 15960 KB Execution failed because the return code was nonzero
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 15960 KB Execution failed because the return code was nonzero
2 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 15960 KB Execution failed because the return code was nonzero
2 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9816 KB Output is correct
2 Correct 3 ms 9816 KB Output is correct
3 Correct 2 ms 9816 KB Output is correct
4 Correct 164 ms 30264 KB Output is correct
5 Correct 676 ms 37316 KB Output is correct
6 Correct 461 ms 24920 KB Output is correct
7 Correct 702 ms 36556 KB Output is correct
8 Correct 369 ms 27480 KB Output is correct
9 Correct 679 ms 37320 KB Output is correct
10 Correct 775 ms 46276 KB Output is correct
11 Correct 819 ms 46704 KB Output is correct
12 Correct 780 ms 48208 KB Output is correct
13 Correct 606 ms 36808 KB Output is correct
14 Correct 784 ms 70480 KB Output is correct
15 Correct 606 ms 62928 KB Output is correct
16 Correct 553 ms 62844 KB Output is correct
17 Correct 4 ms 13912 KB Output is correct
18 Correct 2 ms 9816 KB Output is correct
19 Correct 5 ms 13912 KB Output is correct
20 Correct 5 ms 22104 KB Output is correct
21 Correct 5 ms 22104 KB Output is correct
22 Correct 4 ms 22104 KB Output is correct
23 Correct 5 ms 22104 KB Output is correct
24 Correct 4 ms 20056 KB Output is correct
25 Correct 4 ms 18008 KB Output is correct
26 Correct 4 ms 18264 KB Output is correct
27 Correct 13 ms 18264 KB Output is correct
28 Correct 12 ms 16216 KB Output is correct
29 Correct 12 ms 18264 KB Output is correct
30 Correct 12 ms 18520 KB Output is correct
31 Correct 12 ms 18520 KB Output is correct
32 Correct 2 ms 9816 KB Output is correct
33 Correct 36 ms 30096 KB Output is correct
34 Correct 57 ms 37040 KB Output is correct
35 Correct 52 ms 47940 KB Output is correct
36 Correct 56 ms 36824 KB Output is correct
37 Correct 65 ms 70344 KB Output is correct
38 Correct 58 ms 62920 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9816 KB Output is correct
2 Correct 3 ms 9816 KB Output is correct
3 Correct 2 ms 9816 KB Output is correct
4 Correct 164 ms 30264 KB Output is correct
5 Correct 676 ms 37316 KB Output is correct
6 Correct 461 ms 24920 KB Output is correct
7 Correct 702 ms 36556 KB Output is correct
8 Correct 369 ms 27480 KB Output is correct
9 Correct 679 ms 37320 KB Output is correct
10 Correct 775 ms 46276 KB Output is correct
11 Correct 819 ms 46704 KB Output is correct
12 Correct 780 ms 48208 KB Output is correct
13 Correct 606 ms 36808 KB Output is correct
14 Correct 784 ms 70480 KB Output is correct
15 Correct 606 ms 62928 KB Output is correct
16 Correct 553 ms 62844 KB Output is correct
17 Correct 4 ms 13912 KB Output is correct
18 Correct 2 ms 9816 KB Output is correct
19 Correct 5 ms 13912 KB Output is correct
20 Correct 5 ms 22104 KB Output is correct
21 Correct 5 ms 22104 KB Output is correct
22 Correct 4 ms 22104 KB Output is correct
23 Correct 5 ms 22104 KB Output is correct
24 Correct 4 ms 20056 KB Output is correct
25 Correct 4 ms 18008 KB Output is correct
26 Correct 4 ms 18264 KB Output is correct
27 Correct 13 ms 18264 KB Output is correct
28 Correct 12 ms 16216 KB Output is correct
29 Correct 12 ms 18264 KB Output is correct
30 Correct 12 ms 18520 KB Output is correct
31 Correct 12 ms 18520 KB Output is correct
32 Correct 2 ms 9816 KB Output is correct
33 Correct 36 ms 30096 KB Output is correct
34 Correct 57 ms 37040 KB Output is correct
35 Correct 52 ms 47940 KB Output is correct
36 Correct 56 ms 36824 KB Output is correct
37 Correct 65 ms 70344 KB Output is correct
38 Correct 58 ms 62920 KB Output is correct
39 Correct 2 ms 9816 KB Output is correct
40 Correct 2 ms 9816 KB Output is correct
41 Correct 2 ms 9816 KB Output is correct
42 Correct 149 ms 27708 KB Output is correct
43 Correct 626 ms 37340 KB Output is correct
44 Correct 436 ms 23128 KB Output is correct
45 Correct 666 ms 37300 KB Output is correct
46 Correct 377 ms 25976 KB Output is correct
47 Correct 627 ms 37428 KB Output is correct
48 Correct 772 ms 46164 KB Output is correct
49 Correct 792 ms 46792 KB Output is correct
50 Correct 779 ms 47880 KB Output is correct
51 Correct 673 ms 36828 KB Output is correct
52 Correct 774 ms 70356 KB Output is correct
53 Correct 643 ms 62800 KB Output is correct
54 Correct 617 ms 62920 KB Output is correct
55 Correct 2 ms 9816 KB Output is correct
56 Correct 84 ms 37032 KB Output is correct
57 Correct 623 ms 37320 KB Output is correct
58 Correct 338 ms 21340 KB Output is correct
59 Correct 620 ms 37060 KB Output is correct
60 Correct 285 ms 24672 KB Output is correct
61 Correct 655 ms 37072 KB Output is correct
62 Correct 849 ms 46300 KB Output is correct
63 Correct 828 ms 47244 KB Output is correct
64 Correct 754 ms 46984 KB Output is correct
65 Correct 687 ms 36828 KB Output is correct
66 Correct 887 ms 70352 KB Output is correct
67 Correct 696 ms 62684 KB Output is correct
68 Correct 639 ms 63056 KB Output is correct
69 Correct 2 ms 9816 KB Output is correct
70 Correct 4 ms 20140 KB Output is correct
71 Correct 5 ms 20056 KB Output is correct
72 Correct 6 ms 22104 KB Output is correct
73 Correct 5 ms 22104 KB Output is correct
74 Correct 5 ms 24152 KB Output is correct
75 Correct 5 ms 24152 KB Output is correct
76 Correct 3 ms 13912 KB Output is correct
77 Correct 2 ms 9816 KB Output is correct
78 Correct 3 ms 13912 KB Output is correct
79 Correct 4 ms 22084 KB Output is correct
80 Correct 4 ms 20056 KB Output is correct
81 Correct 4 ms 22104 KB Output is correct
82 Correct 4 ms 20056 KB Output is correct
83 Correct 4 ms 18008 KB Output is correct
84 Correct 3 ms 18008 KB Output is correct
85 Correct 6 ms 18008 KB Output is correct
86 Correct 15 ms 20396 KB Output is correct
87 Correct 15 ms 18264 KB Output is correct
88 Correct 12 ms 18264 KB Output is correct
89 Correct 13 ms 18520 KB Output is correct
90 Correct 11 ms 18520 KB Output is correct
91 Correct 3 ms 18008 KB Output is correct
92 Correct 4 ms 18264 KB Output is correct
93 Correct 13 ms 16216 KB Output is correct
94 Correct 12 ms 18264 KB Output is correct
95 Correct 13 ms 18264 KB Output is correct
96 Correct 15 ms 18520 KB Output is correct
97 Correct 11 ms 20568 KB Output is correct
98 Correct 2 ms 9816 KB Output is correct
99 Correct 66 ms 37332 KB Output is correct
100 Correct 58 ms 37116 KB Output is correct
101 Correct 53 ms 47320 KB Output is correct
102 Correct 61 ms 36832 KB Output is correct
103 Correct 63 ms 70348 KB Output is correct
104 Correct 58 ms 62920 KB Output is correct
105 Correct 2 ms 9816 KB Output is correct
106 Correct 35 ms 31824 KB Output is correct
107 Correct 54 ms 37112 KB Output is correct
108 Correct 47 ms 47960 KB Output is correct
109 Correct 59 ms 36828 KB Output is correct
110 Correct 65 ms 70360 KB Output is correct
111 Correct 60 ms 62940 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9816 KB Output is correct
2 Correct 2 ms 9816 KB Output is correct
3 Runtime error 37 ms 41884 KB Execution failed because the return code was nonzero
4 Halted 0 ms 0 KB -