oj.uz

Submission #770467

# Submission time Handle Problem Language Result Execution time Memory
770467 2023-07-01T09:43:48 Z taitruong270 Growing Trees (BOI11_grow) C++17
100 / 100
 98 ms 2872 KB 
#include <bits/stdc++.h>
using namespace std;

#define N 100000

int n, q, a[N], bit[N];

void add(int l, int r, int x) {  // add x to [l, r]
	if (r < l) return;
	for (; l < n; l |= l + 1) bit[l] += x;
	for (++r; r < n; r |= r + 1) bit[r] -= x;
}
int query(int i) {  // point query at i
	int sum = 0;
	for (; i >= 0; i &= i + 1, --i) sum += bit[i];
	return sum;
}
/* from Benq */
template <class T, class U> T firstTrue(T lo, T hi, U f) {
	assert(lo <= hi);
	++hi;              // assuming f is increasing
	while (lo < hi) {  // find first index such that f is true
		T mid = lo + (hi - lo) / 2;
		f(mid) ? hi = mid : lo = mid + 1;
	}
	return lo;
}

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

	cin >> n >> q;
	for (int i = 0; i < n; ++i) cin >> a[i];
	sort(a, a + n);
	for (int i = 0; i < n; ++i) add(i, i, a[i]);
	for (int i = 0; i < q; ++i) {
		char c;
		int a, b;

		cin >> c >> a >> b;
		if (c == 'F') {
			int l = firstTrue(0, n - 1, [&](int i) { return query(i) >= b; });
			if (l == n)  // found nothing
				continue;
			int r = l + a - 1;
			if (r >= n - 1) {
				add(l, n - 1, 1);
				continue;
			}
			int x = query(r);
			int l_ = firstTrue(l, n - 1, [&](int i) { return query(i) >= x; });
			int r_ =
			    firstTrue(l_, n - 1, [&](int i) { return query(i) > x; }) - 1;
			add(l, l_ - 1, 1);
			add(r_ - (a - (l_ - l)) + 1, r_, 1);
		} else {
			int l = firstTrue(0, n - 1, [&](int i) { return query(i) >= a; });
			int r = firstTrue(0, n - 1, [&](int i) { return query(i) > b; });
			cout << r - l << '\n';
		}
	}
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 1176 KB Output is correct
2 Correct 87 ms 2692 KB Output is correct
3 Correct 29 ms 2624 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 39 ms 1384 KB Output is correct
6 Correct 45 ms 1552 KB Output is correct
7 Correct 4 ms 340 KB Output is correct
8 Correct 25 ms 1040 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 652 KB Output is correct
2 Correct 47 ms 1808 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 28 ms 1316 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 732 KB Output is correct
2 Correct 51 ms 1612 KB Output is correct
3 Correct 5 ms 468 KB Output is correct
4 Correct 53 ms 1756 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 944 KB Output is correct
2 Correct 78 ms 2292 KB Output is correct
3 Correct 14 ms 852 KB Output is correct
4 Correct 32 ms 2176 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 960 KB Output is correct
2 Correct 84 ms 2372 KB Output is correct
3 Correct 28 ms 2532 KB Output is correct
4 Correct 14 ms 856 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 1084 KB Output is correct
2 Correct 53 ms 2312 KB Output is correct
3 Correct 29 ms 2652 KB Output is correct
4 Correct 14 ms 824 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 98 ms 1052 KB Output is correct
2 Correct 81 ms 2272 KB Output is correct
3 Correct 22 ms 1796 KB Output is correct
4 Correct 53 ms 2176 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 1256 KB Output is correct
2 Correct 88 ms 2672 KB Output is correct
3 Correct 90 ms 2872 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 85 ms 1524 KB Output is correct