oj.uz

Submission #429887

# Submission time Handle Problem Language Result Execution time Memory
429887 2021-06-16T10:16:23 Z hhhhaura Rainforest Jumps (APIO21_jumps) C++14
48 / 100
 1986 ms 76428 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] = *it;
		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)
			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 270 ms 60736 KB Output is correct
4 Correct 1467 ms 76276 KB Output is correct
5 Correct 1681 ms 36908 KB Output is correct
6 Correct 1828 ms 76308 KB Output is correct
7 Correct 1283 ms 52096 KB Output is correct
8 Correct 1815 ms 76296 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 260 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Incorrect 4 ms 256 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 260 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Incorrect 4 ms 256 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 1 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 1 ms 220 KB Output is correct
5 Incorrect 243 ms 61380 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 500 ms 33572 KB Output is correct
5 Correct 1720 ms 76240 KB Output is correct
6 Correct 927 ms 11832 KB Output is correct
7 Correct 1551 ms 76224 KB Output is correct
8 Correct 1105 ms 25364 KB Output is correct
9 Correct 1986 ms 76264 KB Output is correct
10 Correct 1824 ms 76188 KB Output is correct
11 Correct 1546 ms 76176 KB Output is correct
12 Correct 1937 ms 76184 KB Output is correct
13 Correct 1260 ms 76244 KB Output is correct
14 Correct 1485 ms 76372 KB Output is correct
15 Correct 1066 ms 76428 KB Output is correct
16 Correct 1591 ms 76288 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 1 ms 200 KB Output is correct
19 Correct 3 ms 200 KB Output is correct
20 Correct 3 ms 328 KB Output is correct
21 Correct 4 ms 328 KB Output is correct
22 Correct 5 ms 328 KB Output is correct
23 Correct 4 ms 328 KB Output is correct
24 Correct 4 ms 200 KB Output is correct
25 Correct 1 ms 328 KB Output is correct
26 Correct 1 ms 456 KB Output is correct
27 Correct 31 ms 804 KB Output is correct
28 Correct 28 ms 808 KB Output is correct
29 Correct 17 ms 816 KB Output is correct
30 Correct 24 ms 812 KB Output is correct
31 Correct 22 ms 804 KB Output is correct
32 Correct 1 ms 200 KB Output is correct
33 Correct 133 ms 42500 KB Output is correct
34 Correct 373 ms 76240 KB Output is correct
35 Correct 175 ms 76200 KB Output is correct
36 Correct 274 ms 76284 KB Output is correct
37 Correct 238 ms 76216 KB Output is correct
38 Correct 197 ms 76256 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 500 ms 33572 KB Output is correct
5 Correct 1720 ms 76240 KB Output is correct
6 Correct 927 ms 11832 KB Output is correct
7 Correct 1551 ms 76224 KB Output is correct
8 Correct 1105 ms 25364 KB Output is correct
9 Correct 1986 ms 76264 KB Output is correct
10 Correct 1824 ms 76188 KB Output is correct
11 Correct 1546 ms 76176 KB Output is correct
12 Correct 1937 ms 76184 KB Output is correct
13 Correct 1260 ms 76244 KB Output is correct
14 Correct 1485 ms 76372 KB Output is correct
15 Correct 1066 ms 76428 KB Output is correct
16 Correct 1591 ms 76288 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 1 ms 200 KB Output is correct
19 Correct 3 ms 200 KB Output is correct
20 Correct 3 ms 328 KB Output is correct
21 Correct 4 ms 328 KB Output is correct
22 Correct 5 ms 328 KB Output is correct
23 Correct 4 ms 328 KB Output is correct
24 Correct 4 ms 200 KB Output is correct
25 Correct 1 ms 328 KB Output is correct
26 Correct 1 ms 456 KB Output is correct
27 Correct 31 ms 804 KB Output is correct
28 Correct 28 ms 808 KB Output is correct
29 Correct 17 ms 816 KB Output is correct
30 Correct 24 ms 812 KB Output is correct
31 Correct 22 ms 804 KB Output is correct
32 Correct 1 ms 200 KB Output is correct
33 Correct 133 ms 42500 KB Output is correct
34 Correct 373 ms 76240 KB Output is correct
35 Correct 175 ms 76200 KB Output is correct
36 Correct 274 ms 76284 KB Output is correct
37 Correct 238 ms 76216 KB Output is correct
38 Correct 197 ms 76256 KB Output is correct
39 Correct 1 ms 256 KB Output is correct
40 Correct 1 ms 200 KB Output is correct
41 Correct 1 ms 244 KB Output is correct
42 Correct 396 ms 33696 KB Output is correct
43 Correct 1563 ms 76184 KB Output is correct
44 Correct 1042 ms 11844 KB Output is correct
45 Correct 1338 ms 76212 KB Output is correct
46 Correct 702 ms 25392 KB Output is correct
47 Correct 1420 ms 76292 KB Output is correct
48 Correct 1565 ms 76352 KB Output is correct
49 Correct 1804 ms 76212 KB Output is correct
50 Correct 1497 ms 76332 KB Output is correct
51 Correct 1469 ms 76268 KB Output is correct
52 Correct 1485 ms 76280 KB Output is correct
53 Correct 1306 ms 76184 KB Output is correct
54 Correct 1125 ms 76284 KB Output is correct
55 Correct 1 ms 200 KB Output is correct
56 Correct 388 ms 76080 KB Output is correct
57 Correct 1882 ms 76300 KB Output is correct
58 Correct 693 ms 12544 KB Output is correct
59 Correct 1805 ms 76288 KB Output is correct
60 Correct 607 ms 26172 KB Output is correct
61 Correct 1903 ms 76288 KB Output is correct
62 Correct 1667 ms 76208 KB Output is correct
63 Correct 1486 ms 76296 KB Output is correct
64 Correct 1780 ms 76204 KB Output is correct
65 Correct 1889 ms 76288 KB Output is correct
66 Correct 1821 ms 76180 KB Output is correct
67 Correct 1553 ms 76272 KB Output is correct
68 Correct 1591 ms 76208 KB Output is correct
69 Correct 1 ms 200 KB Output is correct
70 Correct 1 ms 200 KB Output is correct
71 Correct 3 ms 200 KB Output is correct
72 Correct 4 ms 328 KB Output is correct
73 Correct 3 ms 328 KB Output is correct
74 Correct 3 ms 328 KB Output is correct
75 Correct 3 ms 328 KB Output is correct
76 Correct 0 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 3 ms 328 KB Output is correct
80 Correct 3 ms 200 KB Output is correct
81 Correct 2 ms 328 KB Output is correct
82 Correct 3 ms 328 KB Output is correct
83 Correct 3 ms 328 KB Output is correct
84 Correct 1 ms 328 KB Output is correct
85 Correct 3 ms 328 KB Output is correct
86 Correct 36 ms 808 KB Output is correct
87 Correct 21 ms 712 KB Output is correct
88 Correct 21 ms 712 KB Output is correct
89 Correct 18 ms 712 KB Output is correct
90 Correct 20 ms 712 KB Output is correct
91 Correct 1 ms 328 KB Output is correct
92 Correct 1 ms 456 KB Output is correct
93 Correct 31 ms 812 KB Output is correct
94 Correct 30 ms 712 KB Output is correct
95 Correct 30 ms 820 KB Output is correct
96 Correct 36 ms 712 KB Output is correct
97 Correct 20 ms 820 KB Output is correct
98 Correct 1 ms 200 KB Output is correct
99 Correct 276 ms 75956 KB Output is correct
100 Correct 298 ms 76232 KB Output is correct
101 Correct 162 ms 76300 KB Output is correct
102 Correct 225 ms 76260 KB Output is correct
103 Correct 204 ms 76180 KB Output is correct
104 Correct 177 ms 76244 KB Output is correct
105 Correct 1 ms 200 KB Output is correct
106 Correct 131 ms 42528 KB Output is correct
107 Correct 285 ms 76276 KB Output is correct
108 Correct 178 ms 76292 KB Output is correct
109 Correct 230 ms 76284 KB Output is correct
110 Correct 234 ms 76208 KB Output is correct
111 Correct 174 ms 76268 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 270 ms 60736 KB Output is correct
4 Correct 1467 ms 76276 KB Output is correct
5 Correct 1681 ms 36908 KB Output is correct
6 Correct 1828 ms 76308 KB Output is correct
7 Correct 1283 ms 52096 KB Output is correct
8 Correct 1815 ms 76296 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 260 KB Output is correct
12 Correct 1 ms 200 KB Output is correct
13 Incorrect 4 ms 256 KB Output isn't correct
14 Halted 0 ms 0 KB -