oj.uz

답안 #1096192

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1096192 2024-10-04T05:02:47 Z stdfloat Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
100 / 100
 2599 ms 262144 KB 
#include <bits/stdc++.h>
using namespace std;

using ll = long long;

#define sz(v)  (int)(v).size()
#define all(v) (v).begin(), v.end()

int mx;

vector<int> a, st, vis;

vector<vector<int>> v;

void bld(int nd, int l, int r) {
	if (l == r) {
		vis[nd] = 0; st[nd] = a[l]; v[nd] = {a[l]};
		return;
	}

	int ch = (nd << 1) + 1, md = l + r >> 1;
	bld(ch, l, md); bld(ch + 1, md + 1, r);

	st[nd] = max(st[ch], st[ch + 1]);

	v[nd].assign(sz(v[ch]) + sz(v[ch + 1]), 0);
	merge(all(v[ch]), all(v[ch + 1]), v[nd].begin());
	
	int mx = 0;
	for (int i = l; i <= r; i++) {
		if (mx > a[i]) vis[nd] = max(vis[nd], mx + a[i]);
		else mx = a[i];
	}
}

bool fnd(int nd, int l, int r, int x, int y, int k) {
	if (r < x || y < l) return true;

	if (x <= l && r <= y) {
		bool tr = (max(vis[nd], (mx > v[nd][0] ? mx + *--lower_bound(all(v[nd]), mx) : 0)) <= k);
		mx = max(mx, st[nd]);
		return tr;
	}

	int ch = (nd << 1) + 1, md = l + r >> 1;
	return (!fnd(ch, l, md, x, y, k) || !fnd(ch + 1, md + 1, r, x, y, k) ? false : true);
}

int main() {
	ios::sync_with_stdio(false); cin.tie(nullptr);

	int n, q;
	cin >> n >> q;

	a.assign(n, 0);
	for (auto &i : a)
		cin >> i;

	v.assign(n << 2, {});
	st = vis = vector<int>(n << 2);
	bld(0, 0, n - 1);

	while (q--) {
		int l, r, k;
		cin >> l >> r >> k; l--; r--;

		mx = 0;
		cout << fnd(0, 0, n - 1, l, r, k) << endl;
	}
}

Compilation message

sortbooks.cpp: In function 'void bld(int, int, int)':
sortbooks.cpp:21:33: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   21 |  int ch = (nd << 1) + 1, md = l + r >> 1;
      |                               ~~^~~
sortbooks.cpp: In function 'bool fnd(int, int, int, int, int, int)':
sortbooks.cpp:45:33: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   45 |  int ch = (nd << 1) + 1, md = l + r >> 1;
      |                               ~~^~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 4 ms 856 KB Output is correct
12 Correct 5 ms 1628 KB Output is correct
13 Correct 6 ms 1628 KB Output is correct
14 Correct 8 ms 1628 KB Output is correct
15 Correct 9 ms 1748 KB Output is correct
16 Correct 8 ms 1712 KB Output is correct
17 Correct 7 ms 1372 KB Output is correct
18 Correct 8 ms 1628 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1996 ms 262144 KB Output is correct
2 Correct 2185 ms 262144 KB Output is correct
3 Correct 2080 ms 262144 KB Output is correct
4 Correct 2150 ms 262144 KB Output is correct
5 Correct 2552 ms 262144 KB Output is correct

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 194 ms 26964 KB Output is correct
2 Correct 174 ms 26964 KB Output is correct
3 Correct 205 ms 26792 KB Output is correct
4 Correct 170 ms 26964 KB Output is correct
5 Correct 183 ms 27040 KB Output is correct
6 Correct 161 ms 26644 KB Output is correct
7 Correct 167 ms 26708 KB Output is correct
8 Correct 181 ms 26708 KB Output is correct
9 Correct 119 ms 1876 KB Output is correct
10 Correct 174 ms 26704 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 4 ms 856 KB Output is correct
12 Correct 5 ms 1628 KB Output is correct
13 Correct 6 ms 1628 KB Output is correct
14 Correct 8 ms 1628 KB Output is correct
15 Correct 9 ms 1748 KB Output is correct
16 Correct 8 ms 1712 KB Output is correct
17 Correct 7 ms 1372 KB Output is correct
18 Correct 8 ms 1628 KB Output is correct
19 Correct 407 ms 56916 KB Output is correct
20 Correct 432 ms 57012 KB Output is correct
21 Correct 384 ms 56764 KB Output is correct
22 Correct 424 ms 56816 KB Output is correct
23 Correct 366 ms 56660 KB Output is correct
24 Correct 357 ms 56660 KB Output is correct
25 Correct 355 ms 56676 KB Output is correct
26 Correct 389 ms 56916 KB Output is correct
27 Correct 416 ms 56916 KB Output is correct
28 Correct 412 ms 56912 KB Output is correct
29 Correct 441 ms 56920 KB Output is correct
30 Correct 421 ms 56916 KB Output is correct
31 Correct 438 ms 56912 KB Output is correct
32 Correct 434 ms 56960 KB Output is correct
33 Correct 422 ms 56916 KB Output is correct
34 Correct 351 ms 56664 KB Output is correct
35 Correct 328 ms 56496 KB Output is correct
36 Correct 345 ms 56400 KB Output is correct
37 Correct 329 ms 56400 KB Output is correct
38 Correct 342 ms 56656 KB Output is correct
39 Correct 377 ms 55376 KB Output is correct
40 Correct 332 ms 37460 KB Output is correct
41 Correct 339 ms 55124 KB Output is correct

Subtask #6
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 4 ms 856 KB Output is correct
12 Correct 5 ms 1628 KB Output is correct
13 Correct 6 ms 1628 KB Output is correct
14 Correct 8 ms 1628 KB Output is correct
15 Correct 9 ms 1748 KB Output is correct
16 Correct 8 ms 1712 KB Output is correct
17 Correct 7 ms 1372 KB Output is correct
18 Correct 8 ms 1628 KB Output is correct
19 Correct 1996 ms 262144 KB Output is correct
20 Correct 2185 ms 262144 KB Output is correct
21 Correct 2080 ms 262144 KB Output is correct
22 Correct 2150 ms 262144 KB Output is correct
23 Correct 2552 ms 262144 KB Output is correct
24 Correct 194 ms 26964 KB Output is correct
25 Correct 174 ms 26964 KB Output is correct
26 Correct 205 ms 26792 KB Output is correct
27 Correct 170 ms 26964 KB Output is correct
28 Correct 183 ms 27040 KB Output is correct
29 Correct 161 ms 26644 KB Output is correct
30 Correct 167 ms 26708 KB Output is correct
31 Correct 181 ms 26708 KB Output is correct
32 Correct 119 ms 1876 KB Output is correct
33 Correct 174 ms 26704 KB Output is correct
34 Correct 407 ms 56916 KB Output is correct
35 Correct 432 ms 57012 KB Output is correct
36 Correct 384 ms 56764 KB Output is correct
37 Correct 424 ms 56816 KB Output is correct
38 Correct 366 ms 56660 KB Output is correct
39 Correct 357 ms 56660 KB Output is correct
40 Correct 355 ms 56676 KB Output is correct
41 Correct 389 ms 56916 KB Output is correct
42 Correct 416 ms 56916 KB Output is correct
43 Correct 412 ms 56912 KB Output is correct
44 Correct 441 ms 56920 KB Output is correct
45 Correct 421 ms 56916 KB Output is correct
46 Correct 438 ms 56912 KB Output is correct
47 Correct 434 ms 56960 KB Output is correct
48 Correct 422 ms 56916 KB Output is correct
49 Correct 351 ms 56664 KB Output is correct
50 Correct 328 ms 56496 KB Output is correct
51 Correct 345 ms 56400 KB Output is correct
52 Correct 329 ms 56400 KB Output is correct
53 Correct 342 ms 56656 KB Output is correct
54 Correct 377 ms 55376 KB Output is correct
55 Correct 332 ms 37460 KB Output is correct
56 Correct 339 ms 55124 KB Output is correct
57 Correct 2460 ms 262144 KB Output is correct
58 Correct 2221 ms 262144 KB Output is correct
59 Correct 2446 ms 262144 KB Output is correct
60 Correct 2341 ms 262144 KB Output is correct
61 Correct 2382 ms 262144 KB Output is correct
62 Correct 2343 ms 262144 KB Output is correct
63 Correct 1893 ms 262144 KB Output is correct
64 Correct 1877 ms 262144 KB Output is correct
65 Correct 2496 ms 262144 KB Output is correct
66 Correct 2554 ms 262144 KB Output is correct
67 Correct 2599 ms 262144 KB Output is correct
68 Correct 2527 ms 262144 KB Output is correct
69 Correct 2515 ms 262144 KB Output is correct
70 Correct 2327 ms 262144 KB Output is correct
71 Correct 2505 ms 262144 KB Output is correct
72 Correct 2554 ms 262144 KB Output is correct
73 Correct 1723 ms 262144 KB Output is correct
74 Correct 1737 ms 262144 KB Output is correct
75 Correct 1724 ms 262144 KB Output is correct
76 Correct 1708 ms 262144 KB Output is correct
77 Correct 1725 ms 262144 KB Output is correct
78 Correct 2198 ms 262144 KB Output is correct
79 Correct 1895 ms 158408 KB Output is correct
80 Correct 2035 ms 262144 KB Output is correct