oj.uz

답안 #1096203

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1096203 2024-10-04T05:34:25 Z stdfloat Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
77 / 100
 2426 ms 262148 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 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 464 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 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 2 ms 348 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 464 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 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 2 ms 348 KB Output is correct
11 Correct 5 ms 860 KB Output is correct
12 Correct 6 ms 1628 KB Output is correct
13 Correct 7 ms 1624 KB Output is correct
14 Correct 10 ms 1628 KB Output is correct
15 Correct 10 ms 1624 KB Output is correct
16 Correct 15 ms 1628 KB Output is correct
17 Correct 9 ms 1628 KB Output is correct
18 Correct 8 ms 1628 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2025 ms 262144 KB Output is correct
2 Correct 1984 ms 262144 KB Output is correct
3 Correct 2083 ms 262144 KB Output is correct
4 Correct 2037 ms 262144 KB Output is correct
5 Correct 2426 ms 262144 KB Output is correct

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 202 ms 26960 KB Output is correct
2 Correct 209 ms 26760 KB Output is correct
3 Correct 194 ms 26940 KB Output is correct
4 Correct 203 ms 27016 KB Output is correct
5 Correct 184 ms 26784 KB Output is correct
6 Correct 153 ms 26692 KB Output is correct
7 Correct 169 ms 26708 KB Output is correct
8 Correct 156 ms 26540 KB Output is correct
9 Correct 118 ms 1984 KB Output is correct
10 Correct 163 ms 26704 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 464 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 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 2 ms 348 KB Output is correct
11 Correct 5 ms 860 KB Output is correct
12 Correct 6 ms 1628 KB Output is correct
13 Correct 7 ms 1624 KB Output is correct
14 Correct 10 ms 1628 KB Output is correct
15 Correct 10 ms 1624 KB Output is correct
16 Correct 15 ms 1628 KB Output is correct
17 Correct 9 ms 1628 KB Output is correct
18 Correct 8 ms 1628 KB Output is correct
19 Correct 407 ms 56856 KB Output is correct
20 Correct 403 ms 57040 KB Output is correct
21 Correct 367 ms 56660 KB Output is correct
22 Correct 409 ms 56912 KB Output is correct
23 Correct 386 ms 56660 KB Output is correct
24 Correct 371 ms 56148 KB Output is correct
25 Correct 354 ms 56144 KB Output is correct
26 Correct 419 ms 56404 KB Output is correct
27 Correct 396 ms 56404 KB Output is correct
28 Correct 408 ms 56404 KB Output is correct
29 Correct 400 ms 56404 KB Output is correct
30 Correct 402 ms 56404 KB Output is correct
31 Correct 417 ms 56884 KB Output is correct
32 Correct 401 ms 56636 KB Output is correct
33 Correct 426 ms 56656 KB Output is correct
34 Correct 348 ms 56144 KB Output is correct
35 Correct 342 ms 56284 KB Output is correct
36 Correct 334 ms 56144 KB Output is correct
37 Correct 344 ms 56000 KB Output is correct
38 Correct 339 ms 56400 KB Output is correct
39 Correct 380 ms 55120 KB Output is correct
40 Correct 314 ms 37160 KB Output is correct
41 Correct 337 ms 54356 KB Output is correct

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 464 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 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 2 ms 348 KB Output is correct
11 Correct 5 ms 860 KB Output is correct
12 Correct 6 ms 1628 KB Output is correct
13 Correct 7 ms 1624 KB Output is correct
14 Correct 10 ms 1628 KB Output is correct
15 Correct 10 ms 1624 KB Output is correct
16 Correct 15 ms 1628 KB Output is correct
17 Correct 9 ms 1628 KB Output is correct
18 Correct 8 ms 1628 KB Output is correct
19 Correct 2025 ms 262144 KB Output is correct
20 Correct 1984 ms 262144 KB Output is correct
21 Correct 2083 ms 262144 KB Output is correct
22 Correct 2037 ms 262144 KB Output is correct
23 Correct 2426 ms 262144 KB Output is correct
24 Correct 202 ms 26960 KB Output is correct
25 Correct 209 ms 26760 KB Output is correct
26 Correct 194 ms 26940 KB Output is correct
27 Correct 203 ms 27016 KB Output is correct
28 Correct 184 ms 26784 KB Output is correct
29 Correct 153 ms 26692 KB Output is correct
30 Correct 169 ms 26708 KB Output is correct
31 Correct 156 ms 26540 KB Output is correct
32 Correct 118 ms 1984 KB Output is correct
33 Correct 163 ms 26704 KB Output is correct
34 Correct 407 ms 56856 KB Output is correct
35 Correct 403 ms 57040 KB Output is correct
36 Correct 367 ms 56660 KB Output is correct
37 Correct 409 ms 56912 KB Output is correct
38 Correct 386 ms 56660 KB Output is correct
39 Correct 371 ms 56148 KB Output is correct
40 Correct 354 ms 56144 KB Output is correct
41 Correct 419 ms 56404 KB Output is correct
42 Correct 396 ms 56404 KB Output is correct
43 Correct 408 ms 56404 KB Output is correct
44 Correct 400 ms 56404 KB Output is correct
45 Correct 402 ms 56404 KB Output is correct
46 Correct 417 ms 56884 KB Output is correct
47 Correct 401 ms 56636 KB Output is correct
48 Correct 426 ms 56656 KB Output is correct
49 Correct 348 ms 56144 KB Output is correct
50 Correct 342 ms 56284 KB Output is correct
51 Correct 334 ms 56144 KB Output is correct
52 Correct 344 ms 56000 KB Output is correct
53 Correct 339 ms 56400 KB Output is correct
54 Correct 380 ms 55120 KB Output is correct
55 Correct 314 ms 37160 KB Output is correct
56 Correct 337 ms 54356 KB Output is correct
57 Correct 2265 ms 262144 KB Output is correct
58 Correct 2354 ms 262144 KB Output is correct
59 Correct 2354 ms 262144 KB Output is correct
60 Correct 2282 ms 262144 KB Output is correct
61 Correct 2341 ms 262144 KB Output is correct
62 Correct 2409 ms 262144 KB Output is correct
63 Runtime error 1894 ms 262148 KB Memory limit exceeded
64 Halted 0 ms 0 KB -