oj.uz

Submission #429898

# Submission time Handle Problem Language Result Execution time Memory
429898 2021-06-16T10:20:47 Z hhhhaura Rainforest Jumps (APIO21_jumps) C++14
48 / 100
 2158 ms 76464 KB 
#define wiwihorz
#include "jumps.h"
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma loop-opt(on)

#define rep(i, a, b) for(int i = a; i <= b; i++)
#define rrep(i, a, b) for(int i = b; i >= a; i--)
#define ceil(a, b) ((a + b - 1) / (b))
#define all(x) x.begin(), x.end()

#define MOD 1000000007
#define eps (1e-9)
#define INF 1000000000
using namespace std;

#define lld long double
#define pii pair<int, int>
#define random mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count())

#ifdef wiwihorz
#define print(a...) kout("[" + string(#a) + "] = ", a)
void vprint(auto L, auto R) {while(L < R) cerr << *L << " \n"[next(L) == R], ++L; }
void kout() {cerr << endl; }
template<class T1, class ... T2> void kout(T1 a, T2 ... e) { cerr << a << " ", kout(e...);}
#else
#define print(...) 0
#define vprint(...) 0
#endif
int n, lg;
vector<int> L, R, h;
vector<vector<int>> l, r;
vector<vector<pii>> sp;
int query(int L, int R) {
	if(L > R) return -1;
	int cur = 31 - __builtin_clz(R - L + 1);
	pii ans = max(sp[cur][L], sp[cur][R - (1 << cur) + 1]);
	return ans.second;
}
void init(int N, vector<int> H) {
	n = N, lg = 32 - __builtin_clz(n);
	set<int> s; vector<int> a(n, 0);
	L.assign(n + 2, 0);
	R.assign(n + 2, 0);
	h.assign(n + 2, 0);
	h[0] = h[n + 1] = INF;
	rep(i, 0, n - 1) h[i + 1] = H[i];
	rep(i, 1, n) a[i - 1] = i;
	sort(all(a), [](int x, int y) { return h[x] > h[y]; });
	s.insert(n + 1), s.insert(0);
	for(auto i : a) {
		auto it = s.lower_bound(i);
		int x = *it, y = *prev(it);
		if(h[x] < h[y]) swap(x, y);
		R[i] = x, L[i] = y;
		s.insert(i);
	}
	l.assign(lg + 1, vector<int>(n + 2, 0));
	r.assign(lg + 1, vector<int>(n + 2, 0));
	sp.assign(lg + 1, vector<pii>(n + 2, {0, 0}));
	L[0] = R[0] = 0, L[n + 1] = R[n + 1] = n + 1;
	rep(i, 0, n + 1) {
		sp[0][i] = {h[i], i};
		l[0][i] = L[i];
		r[0][i] = R[i];
	}
	rep(i, 1, lg) rep(j, 0, n + 1) {
		sp[i][j] = max(sp[i - 1][j], sp[i - 1][j + (1 << (i - 1))]);
		l[i][j] = l[i - 1][l[i - 1][j]];
		r[i][j] = r[i - 1][r[i - 1][j]];

	}
	return;
}
/*
7 3
3 2 1 6 4 5 7
4 4 6 6
1 3 5 6
0 1 2 2 
*/
int minimum_jumps(int A, int B, int C, int D) {
	A ++ ,B ++ , C ++, D ++;	
	int st, ll = A - 1, rr = B + 1, ans = 0, mx;
	mx = query(C, D);
	while(rr - ll > 1) {
		int mid = (ll + rr) / 2;
		int x = query(mid, B);
		if(h[mx] < h[x]) ll = mid;
		else rr = mid;
	} 
	st = query(rr, B);
	if(st == -1) return -1;
	rrep(i, 0, lg) {
		if(h[r[i][st]] < h[mx] && r[i][st] < C && l[i][st] < C)
			st = r[i][st], ans += (1 << i);
	}
	if(r[0][st] <= D && r[0][st] >= C) return ans + 1;
	rrep(i, 0, lg) if(h[l[i][st]] <= h[C]) {
		if(h[l[i][st]] < h[mx] && l[i][st] < C)
			st = l[i][st], ans += (1 << i);
	}
	st = l[0][st];
	if(st <= D && st >= C) return ans + 1;
	return -1;
}

Compilation message

jumps.cpp:5: warning: ignoring '#pragma loop ' [-Wunknown-pragmas]
    5 | #pragma loop-opt(on)
      | 
jumps.cpp:23:13: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   23 | void vprint(auto L, auto R) {while(L < R) cerr << *L << " \n"[next(L) == R], ++L; }
      |             ^~~~
jumps.cpp:23:21: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   23 | void vprint(auto L, auto R) {while(L < R) cerr << *L << " \n"[next(L) == R], ++L; }
      |                     ^~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 283 ms 60652 KB Output is correct
4 Correct 1752 ms 76292 KB Output is correct
5 Correct 1264 ms 36992 KB Output is correct
6 Correct 1734 ms 76284 KB Output is correct
7 Correct 1245 ms 52088 KB Output is correct
8 Correct 1293 ms 76268 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 200 KB Output is correct
5 Incorrect 1 ms 200 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 200 KB Output is correct
5 Incorrect 1 ms 200 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
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 1 ms 200 KB Output is correct
4 Correct 0 ms 200 KB Output is correct
5 Incorrect 217 ms 61488 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 423 ms 33572 KB Output is correct
5 Correct 1283 ms 76340 KB Output is correct
6 Correct 918 ms 11836 KB Output is correct
7 Correct 1213 ms 76244 KB Output is correct
8 Correct 696 ms 25376 KB Output is correct
9 Correct 1500 ms 76396 KB Output is correct
10 Correct 1572 ms 76208 KB Output is correct
11 Correct 1640 ms 76292 KB Output is correct
12 Correct 1597 ms 76188 KB Output is correct
13 Correct 1557 ms 76292 KB Output is correct
14 Correct 1402 ms 76192 KB Output is correct
15 Correct 1159 ms 76208 KB Output is correct
16 Correct 1132 ms 76208 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 5 ms 328 KB Output is correct
21 Correct 4 ms 328 KB Output is correct
22 Correct 4 ms 200 KB Output is correct
23 Correct 3 ms 328 KB Output is correct
24 Correct 3 ms 328 KB Output is correct
25 Correct 1 ms 328 KB Output is correct
26 Correct 2 ms 456 KB Output is correct
27 Correct 18 ms 812 KB Output is correct
28 Correct 32 ms 712 KB Output is correct
29 Correct 19 ms 712 KB Output is correct
30 Correct 32 ms 712 KB Output is correct
31 Correct 30 ms 712 KB Output is correct
32 Correct 0 ms 200 KB Output is correct
33 Correct 137 ms 42532 KB Output is correct
34 Correct 305 ms 76224 KB Output is correct
35 Correct 181 ms 76284 KB Output is correct
36 Correct 272 ms 76248 KB Output is correct
37 Correct 219 ms 76228 KB Output is correct
38 Correct 174 ms 76288 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 423 ms 33572 KB Output is correct
5 Correct 1283 ms 76340 KB Output is correct
6 Correct 918 ms 11836 KB Output is correct
7 Correct 1213 ms 76244 KB Output is correct
8 Correct 696 ms 25376 KB Output is correct
9 Correct 1500 ms 76396 KB Output is correct
10 Correct 1572 ms 76208 KB Output is correct
11 Correct 1640 ms 76292 KB Output is correct
12 Correct 1597 ms 76188 KB Output is correct
13 Correct 1557 ms 76292 KB Output is correct
14 Correct 1402 ms 76192 KB Output is correct
15 Correct 1159 ms 76208 KB Output is correct
16 Correct 1132 ms 76208 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 5 ms 328 KB Output is correct
21 Correct 4 ms 328 KB Output is correct
22 Correct 4 ms 200 KB Output is correct
23 Correct 3 ms 328 KB Output is correct
24 Correct 3 ms 328 KB Output is correct
25 Correct 1 ms 328 KB Output is correct
26 Correct 2 ms 456 KB Output is correct
27 Correct 18 ms 812 KB Output is correct
28 Correct 32 ms 712 KB Output is correct
29 Correct 19 ms 712 KB Output is correct
30 Correct 32 ms 712 KB Output is correct
31 Correct 30 ms 712 KB Output is correct
32 Correct 0 ms 200 KB Output is correct
33 Correct 137 ms 42532 KB Output is correct
34 Correct 305 ms 76224 KB Output is correct
35 Correct 181 ms 76284 KB Output is correct
36 Correct 272 ms 76248 KB Output is correct
37 Correct 219 ms 76228 KB Output is correct
38 Correct 174 ms 76288 KB Output is correct
39 Correct 0 ms 200 KB Output is correct
40 Correct 1 ms 200 KB Output is correct
41 Correct 1 ms 200 KB Output is correct
42 Correct 497 ms 33624 KB Output is correct
43 Correct 1208 ms 76288 KB Output is correct
44 Correct 866 ms 11792 KB Output is correct
45 Correct 1122 ms 76220 KB Output is correct
46 Correct 483 ms 25392 KB Output is correct
47 Correct 1865 ms 76288 KB Output is correct
48 Correct 1618 ms 76200 KB Output is correct
49 Correct 1492 ms 76284 KB Output is correct
50 Correct 1456 ms 76184 KB Output is correct
51 Correct 1611 ms 76216 KB Output is correct
52 Correct 1559 ms 76244 KB Output is correct
53 Correct 1363 ms 76180 KB Output is correct
54 Correct 1429 ms 76284 KB Output is correct
55 Correct 0 ms 200 KB Output is correct
56 Correct 344 ms 76004 KB Output is correct
57 Correct 1982 ms 76280 KB Output is correct
58 Correct 890 ms 12496 KB Output is correct
59 Correct 2158 ms 76260 KB Output is correct
60 Correct 665 ms 26112 KB Output is correct
61 Correct 1817 ms 76176 KB Output is correct
62 Correct 1792 ms 76228 KB Output is correct
63 Correct 1795 ms 76252 KB Output is correct
64 Correct 1755 ms 76464 KB Output is correct
65 Correct 1723 ms 76276 KB Output is correct
66 Correct 1609 ms 76296 KB Output is correct
67 Correct 1365 ms 76180 KB Output is correct
68 Correct 1513 ms 76208 KB Output is correct
69 Correct 1 ms 200 KB Output is correct
70 Correct 2 ms 200 KB Output is correct
71 Correct 2 ms 328 KB Output is correct
72 Correct 3 ms 200 KB Output is correct
73 Correct 3 ms 328 KB Output is correct
74 Correct 2 ms 200 KB Output is correct
75 Correct 5 ms 384 KB Output is correct
76 Correct 1 ms 200 KB Output is correct
77 Correct 1 ms 200 KB Output is correct
78 Correct 2 ms 200 KB Output is correct
79 Correct 4 ms 328 KB Output is correct
80 Correct 3 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 384 KB Output is correct
84 Correct 1 ms 328 KB Output is correct
85 Correct 6 ms 328 KB Output is correct
86 Correct 30 ms 808 KB Output is correct
87 Correct 23 ms 812 KB Output is correct
88 Correct 25 ms 712 KB Output is correct
89 Correct 24 ms 712 KB Output is correct
90 Correct 36 ms 808 KB Output is correct
91 Correct 1 ms 328 KB Output is correct
92 Correct 1 ms 456 KB Output is correct
93 Correct 26 ms 808 KB Output is correct
94 Correct 19 ms 824 KB Output is correct
95 Correct 34 ms 712 KB Output is correct
96 Correct 27 ms 812 KB Output is correct
97 Correct 32 ms 712 KB Output is correct
98 Correct 1 ms 200 KB Output is correct
99 Correct 320 ms 75964 KB Output is correct
100 Correct 295 ms 76184 KB Output is correct
101 Correct 194 ms 76336 KB Output is correct
102 Correct 273 ms 76276 KB Output is correct
103 Correct 257 ms 76180 KB Output is correct
104 Correct 190 ms 76236 KB Output is correct
105 Correct 1 ms 200 KB Output is correct
106 Correct 137 ms 42564 KB Output is correct
107 Correct 325 ms 76204 KB Output is correct
108 Correct 194 ms 76248 KB Output is correct
109 Correct 276 ms 76228 KB Output is correct
110 Correct 217 ms 76276 KB Output is correct
111 Correct 194 ms 76180 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 283 ms 60652 KB Output is correct
4 Correct 1752 ms 76292 KB Output is correct
5 Correct 1264 ms 36992 KB Output is correct
6 Correct 1734 ms 76284 KB Output is correct
7 Correct 1245 ms 52088 KB Output is correct
8 Correct 1293 ms 76268 KB Output is correct
9 Correct 1 ms 200 KB Output is correct
10 Correct 1 ms 200 KB Output is correct
11 Correct 1 ms 200 KB Output is correct
12 Correct 1 ms 200 KB Output is correct
13 Incorrect 1 ms 200 KB Output isn't correct
14 Halted 0 ms 0 KB -