oj.uz

Submission #429990

# Submission time Handle Problem Language Result Execution time Memory
429990 2021-06-16T10:54:02 Z hhhhaura Rainforest Jumps (APIO21_jumps) C++14
48 / 100
 2058 ms 91316 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, t;
vector<vector<int>> l, r, to;
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);
	t.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, t[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}));
	to.assign(lg + 1, vector<int>(n + 2, 0));
	L[0] = R[0] = 0;
	L[n + 1] = R[n + 1] = n + 1;
	t[0] = n + 1, t[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];
		to[0][i] = t[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]];
		to[i][j] = to[i - 1][to[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);
	}
	rrep(i, 0, lg) if(to[i][st] < C) 
		st = to[i][st], ans += (1 << i);
	st = to[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 0 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 302 ms 72640 KB Output is correct
4 Correct 1455 ms 91192 KB Output is correct
5 Correct 1296 ms 44056 KB Output is correct
6 Correct 1577 ms 91104 KB Output is correct
7 Correct 1297 ms 62332 KB Output is correct
8 Correct 1308 ms 91112 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 0 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 Correct 3 ms 200 KB Output is correct
6 Correct 3 ms 328 KB Output is correct
7 Correct 3 ms 328 KB Output is correct
8 Correct 5 ms 328 KB Output is correct
9 Incorrect 1 ms 328 KB Output isn't correct
10 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 0 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 Correct 3 ms 200 KB Output is correct
6 Correct 3 ms 328 KB Output is correct
7 Correct 3 ms 328 KB Output is correct
8 Correct 5 ms 328 KB Output is correct
9 Incorrect 1 ms 328 KB Output isn't correct
10 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 204 KB Output is correct
5 Correct 209 ms 73392 KB Output is correct
6 Correct 281 ms 91128 KB Output is correct
7 Correct 111 ms 44644 KB Output is correct
8 Correct 276 ms 91108 KB Output is correct
9 Correct 38 ms 12120 KB Output is correct
10 Correct 278 ms 91112 KB Output is correct
11 Correct 219 ms 91112 KB Output is correct
12 Correct 187 ms 91128 KB Output is correct
13 Correct 177 ms 91152 KB Output is correct
14 Correct 237 ms 91120 KB Output is correct
15 Incorrect 200 ms 91124 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 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 506 ms 40060 KB Output is correct
5 Correct 1396 ms 91192 KB Output is correct
6 Correct 664 ms 13960 KB Output is correct
7 Correct 1486 ms 91088 KB Output is correct
8 Correct 986 ms 30228 KB Output is correct
9 Correct 1474 ms 91124 KB Output is correct
10 Correct 1254 ms 91188 KB Output is correct
11 Correct 1680 ms 91112 KB Output is correct
12 Correct 1333 ms 91144 KB Output is correct
13 Correct 1416 ms 91176 KB Output is correct
14 Correct 1487 ms 91156 KB Output is correct
15 Correct 1414 ms 91128 KB Output is correct
16 Correct 1581 ms 91196 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 7 ms 328 KB Output is correct
21 Correct 2 ms 328 KB Output is correct
22 Correct 4 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 1 ms 280 KB Output is correct
26 Correct 3 ms 456 KB Output is correct
27 Correct 33 ms 900 KB Output is correct
28 Correct 22 ms 904 KB Output is correct
29 Correct 38 ms 908 KB Output is correct
30 Correct 36 ms 912 KB Output is correct
31 Correct 22 ms 840 KB Output is correct
32 Correct 1 ms 200 KB Output is correct
33 Correct 161 ms 50616 KB Output is correct
34 Correct 384 ms 91156 KB Output is correct
35 Correct 190 ms 91088 KB Output is correct
36 Correct 279 ms 91124 KB Output is correct
37 Correct 266 ms 91104 KB Output is correct
38 Correct 199 ms 91140 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 506 ms 40060 KB Output is correct
5 Correct 1396 ms 91192 KB Output is correct
6 Correct 664 ms 13960 KB Output is correct
7 Correct 1486 ms 91088 KB Output is correct
8 Correct 986 ms 30228 KB Output is correct
9 Correct 1474 ms 91124 KB Output is correct
10 Correct 1254 ms 91188 KB Output is correct
11 Correct 1680 ms 91112 KB Output is correct
12 Correct 1333 ms 91144 KB Output is correct
13 Correct 1416 ms 91176 KB Output is correct
14 Correct 1487 ms 91156 KB Output is correct
15 Correct 1414 ms 91128 KB Output is correct
16 Correct 1581 ms 91196 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 7 ms 328 KB Output is correct
21 Correct 2 ms 328 KB Output is correct
22 Correct 4 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 1 ms 280 KB Output is correct
26 Correct 3 ms 456 KB Output is correct
27 Correct 33 ms 900 KB Output is correct
28 Correct 22 ms 904 KB Output is correct
29 Correct 38 ms 908 KB Output is correct
30 Correct 36 ms 912 KB Output is correct
31 Correct 22 ms 840 KB Output is correct
32 Correct 1 ms 200 KB Output is correct
33 Correct 161 ms 50616 KB Output is correct
34 Correct 384 ms 91156 KB Output is correct
35 Correct 190 ms 91088 KB Output is correct
36 Correct 279 ms 91124 KB Output is correct
37 Correct 266 ms 91104 KB Output is correct
38 Correct 199 ms 91140 KB Output is correct
39 Correct 1 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 292 ms 40084 KB Output is correct
43 Correct 1756 ms 91184 KB Output is correct
44 Correct 937 ms 13980 KB Output is correct
45 Correct 969 ms 91140 KB Output is correct
46 Correct 914 ms 30232 KB Output is correct
47 Correct 1114 ms 91316 KB Output is correct
48 Correct 1756 ms 91132 KB Output is correct
49 Correct 1505 ms 91104 KB Output is correct
50 Correct 1642 ms 91096 KB Output is correct
51 Correct 1743 ms 91176 KB Output is correct
52 Correct 1542 ms 91104 KB Output is correct
53 Correct 1330 ms 91184 KB Output is correct
54 Correct 1532 ms 91236 KB Output is correct
55 Correct 1 ms 200 KB Output is correct
56 Correct 378 ms 90712 KB Output is correct
57 Correct 1590 ms 91156 KB Output is correct
58 Correct 457 ms 14936 KB Output is correct
59 Correct 2058 ms 91120 KB Output is correct
60 Correct 848 ms 31116 KB Output is correct
61 Correct 2037 ms 91068 KB Output is correct
62 Correct 1692 ms 91100 KB Output is correct
63 Correct 1622 ms 91212 KB Output is correct
64 Correct 1972 ms 91140 KB Output is correct
65 Correct 1658 ms 91108 KB Output is correct
66 Correct 1837 ms 91132 KB Output is correct
67 Correct 1730 ms 91132 KB Output is correct
68 Correct 1927 ms 91180 KB Output is correct
69 Correct 1 ms 200 KB Output is correct
70 Correct 1 ms 200 KB Output is correct
71 Correct 4 ms 328 KB Output is correct
72 Correct 4 ms 328 KB Output is correct
73 Correct 2 ms 328 KB Output is correct
74 Correct 4 ms 328 KB Output is correct
75 Correct 3 ms 328 KB Output is correct
76 Correct 1 ms 200 KB Output is correct
77 Correct 1 ms 200 KB Output is correct
78 Correct 4 ms 200 KB Output is correct
79 Correct 4 ms 328 KB Output is correct
80 Correct 2 ms 328 KB Output is correct
81 Correct 4 ms 328 KB Output is correct
82 Correct 4 ms 328 KB Output is correct
83 Correct 5 ms 328 KB Output is correct
84 Correct 1 ms 328 KB Output is correct
85 Correct 6 ms 328 KB Output is correct
86 Correct 12 ms 840 KB Output is correct
87 Correct 31 ms 840 KB Output is correct
88 Correct 39 ms 840 KB Output is correct
89 Correct 14 ms 920 KB Output is correct
90 Correct 34 ms 840 KB Output is correct
91 Correct 1 ms 328 KB Output is correct
92 Correct 2 ms 456 KB Output is correct
93 Correct 20 ms 840 KB Output is correct
94 Correct 21 ms 916 KB Output is correct
95 Correct 30 ms 840 KB Output is correct
96 Correct 17 ms 840 KB Output is correct
97 Correct 19 ms 840 KB Output is correct
98 Correct 0 ms 200 KB Output is correct
99 Correct 308 ms 91052 KB Output is correct
100 Correct 346 ms 91172 KB Output is correct
101 Correct 177 ms 91108 KB Output is correct
102 Correct 259 ms 91280 KB Output is correct
103 Correct 246 ms 91132 KB Output is correct
104 Correct 183 ms 91180 KB Output is correct
105 Correct 1 ms 200 KB Output is correct
106 Correct 140 ms 50688 KB Output is correct
107 Correct 340 ms 91248 KB Output is correct
108 Correct 176 ms 91112 KB Output is correct
109 Correct 306 ms 91244 KB Output is correct
110 Correct 210 ms 91144 KB Output is correct
111 Correct 180 ms 91156 KB Output is correct

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 Correct 302 ms 72640 KB Output is correct
4 Correct 1455 ms 91192 KB Output is correct
5 Correct 1296 ms 44056 KB Output is correct
6 Correct 1577 ms 91104 KB Output is correct
7 Correct 1297 ms 62332 KB Output is correct
8 Correct 1308 ms 91112 KB Output is correct
9 Correct 1 ms 200 KB Output is correct
10 Correct 0 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 Correct 3 ms 200 KB Output is correct
14 Correct 3 ms 328 KB Output is correct
15 Correct 3 ms 328 KB Output is correct
16 Correct 5 ms 328 KB Output is correct
17 Incorrect 1 ms 328 KB Output isn't correct
18 Halted 0 ms 0 KB -