oj.uz

Submission #929853

# Submission time Handle Problem Language Result Execution time Memory
929853 2024-02-18T08:21:24 Z FanOfWilliamLin Growing Trees (BOI11_grow) C++14
100 / 100
 108 ms 3392 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;
}

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 59 ms 2508 KB Output is correct
2 Correct 101 ms 2768 KB Output is correct
3 Correct 30 ms 2756 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 3 ms 500 KB Output is correct
3 Correct 2 ms 596 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 43 ms 1372 KB Output is correct
6 Correct 48 ms 1620 KB Output is correct
7 Correct 4 ms 348 KB Output is correct
8 Correct 25 ms 1528 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 1620 KB Output is correct
2 Correct 49 ms 1716 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 31 ms 1436 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 1880 KB Output is correct
2 Correct 52 ms 1728 KB Output is correct
3 Correct 5 ms 600 KB Output is correct
4 Correct 48 ms 1864 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 2052 KB Output is correct
2 Correct 84 ms 2404 KB Output is correct
3 Correct 18 ms 856 KB Output is correct
4 Correct 35 ms 2404 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 93 ms 2168 KB Output is correct
2 Correct 85 ms 2388 KB Output is correct
3 Correct 31 ms 2644 KB Output is correct
4 Correct 18 ms 864 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 2240 KB Output is correct
2 Correct 60 ms 2488 KB Output is correct
3 Correct 39 ms 2748 KB Output is correct
4 Correct 14 ms 860 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 92 ms 2760 KB Output is correct
2 Correct 84 ms 2384 KB Output is correct
3 Correct 24 ms 1944 KB Output is correct
4 Correct 55 ms 2184 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 2644 KB Output is correct
2 Correct 108 ms 2728 KB Output is correct
3 Correct 92 ms 3096 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 3392 KB Output is correct