oj.uz

답안 #949886

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
949886 2024-03-19T20:09:36 Z MinaRagy06 가로등 (APIO19_street_lamps) C++17
100 / 100
 1052 ms 45112 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define ll long long

const int N = 300'005;
struct BIT {
	int n, bit[N];
	void init(int _n) {
		n = _n;
		for (int i = 0; i < n; i++) {
			bit[i] = 0;
		}
	}
	int get(int r) {
		int ans = 0;
		for (int i = r; i >= 0; i = (i & (i + 1)) - 1) {
			ans += bit[i];
		}
		return ans;
	}
	void add(int x, int v) {
		for (int i = x; i < n; i = i | (i + 1)) {
			bit[i] += v;
		}
	}
} bit;
int ans[N];
vector<array<int, 2>> upd[N], ask[N];
void process(vector<array<int, 3>> &add, vector<array<int, 3>> &q) {
	vector<int> gud;
	for (auto [l, r, v] : add) {
		gud.push_back(l);
		gud.push_back(r);
	}
	for (auto [l, r, idx] : q) {
		gud.push_back(l);
		gud.push_back(r);
	}
	sort(gud.begin(), gud.end());
	gud.resize(unique(gud.begin(), gud.end()) - gud.begin());
	auto get = [&] (int x) {
		return (int) (lower_bound(gud.begin(), gud.end(), x) - gud.begin());
	};
	int n = gud.size();
	for (int i = 0; i < n; i++) {
		upd[i].clear();
		ask[i].clear();
	}
	bit.init(n);
	for (auto [l, r, v] : add) {
		upd[get(l)].push_back({get(r), v});
	}
	for (auto [l, r, idx] : q) {
		ask[get(l)].push_back({get(r), idx});
	}
	for (int l = 0; l < n; l++) {
		for (auto [r, v] : upd[l]) {
			bit.add(n - 1 - r, v);
		}
		for (auto [r, idx] : ask[l]) {
			ans[idx] += bit.get(n - 1 - r);
		}
	}
}
void solve(int l, int r, vector<array<int, 4>> &qq) {
	if (l >= r) return;
	int md = (l + r) / 2;
	vector<array<int, 3>> v1, v2;
	for (int i = l; i <= md; i++) {
		if (qq[i][0] == 1) {
			v1.push_back({qq[i][1], qq[i][2], qq[i][3]});
		}
	}
	for (int i = md + 1; i <= r; i++) {
		if (qq[i][0] == 0) {
			v2.push_back({qq[i][1], qq[i][2], qq[i][3]});
		}
	}
	process(v1, v2);
	solve(l, md, qq);
	solve(md + 1, r, qq);
}
int main() {
	ios_base::sync_with_stdio(0), cin.tie(0);
	int n, q;
	cin >> n >> q;
	string arr;
	cin >> arr;
	arr += '0';
	int lst = -1;
	set<array<int, 3>> s;
	vector<array<int, 4>> qq;
	for (int i = 0; i <= n; i++) {
		if (arr[i] == '1') continue;
		if (lst + 1 <= i - 1) {
			s.insert({lst + 1, i - 1, 0});
		}
		lst = i;
	}
	for (int k = 1; k <= q; k++) {
		string type;
		cin >> type;
		if (type == "toggle") {
			ans[k] = -1;
			int i;
			cin >> i;
			i--;
			if (arr[i] == '1') {
				auto it = s.lower_bound({i + 1, 0});
				it--;
				array<int, 3> v = *it;
				qq.push_back({1, v[0], v[1], k - v[2]});
				s.erase(it);
				if (v[0] <= i - 1) {
					s.insert({v[0], i - 1, k});
				}
				if (i + 1 <= v[1]) {
					s.insert({i + 1, v[1], k});
				}
			} else {
				int l = i, r = i;
				auto it = s.lower_bound({i + 1, 0, k});
				if (it != s.end() && (*it)[0] == i + 1) {
					r = (*it)[1];
					qq.push_back({1, (*it)[0], (*it)[1], k - (*it)[2]});
					it = s.erase(it);
				}
				if (it != s.begin() && (*(--it))[1] == i - 1) {
					l = (*it)[0];
					qq.push_back({1, (*it)[0], (*it)[1], k - (*it)[2]});
					s.erase(it);
				}
				s.insert({l, r, k});
			}
			arr[i] = !(arr[i] - '0') + '0';
		} else {
			int a, b;
			cin >> a >> b;
			a--, b -= 2;
			qq.push_back({0, a, b, k});
			auto it = s.lower_bound({a + 1, 0});
			if (it != s.begin()) {
				it--;
				if (b <= (*it)[1]) {
					ans[k] += k - (*it)[2];
				}
			}
		}
	}
	solve(0, qq.size() - 1, qq);
	for (int k = 1; k <= q; k++) {
		if (ans[k] == -1) continue;
		cout << ans[k] << '\n';
	}
	return 0;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 14940 KB Output is correct
2 Correct 4 ms 14940 KB Output is correct
3 Correct 3 ms 14940 KB Output is correct
4 Correct 4 ms 14940 KB Output is correct
5 Correct 3 ms 14940 KB Output is correct
6 Correct 4 ms 15196 KB Output is correct
7 Correct 3 ms 14940 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 472 ms 28852 KB Output is correct
2 Correct 542 ms 29100 KB Output is correct
3 Correct 672 ms 30464 KB Output is correct
4 Correct 823 ms 38360 KB Output is correct
5 Correct 960 ms 36732 KB Output is correct
6 Correct 862 ms 45112 KB Output is correct
7 Correct 641 ms 33272 KB Output is correct
8 Correct 601 ms 32508 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 14936 KB Output is correct
2 Correct 5 ms 14940 KB Output is correct
3 Correct 5 ms 14940 KB Output is correct
4 Correct 5 ms 14936 KB Output is correct
5 Correct 761 ms 31948 KB Output is correct
6 Correct 972 ms 36848 KB Output is correct
7 Correct 1052 ms 37600 KB Output is correct
8 Correct 703 ms 34204 KB Output is correct
9 Correct 254 ms 24868 KB Output is correct
10 Correct 293 ms 30064 KB Output is correct
11 Correct 282 ms 28360 KB Output is correct
12 Correct 708 ms 33364 KB Output is correct
13 Correct 721 ms 34764 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 14940 KB Output is correct
2 Correct 5 ms 14936 KB Output is correct
3 Correct 5 ms 14940 KB Output is correct
4 Correct 5 ms 14940 KB Output is correct
5 Correct 819 ms 38520 KB Output is correct
6 Correct 904 ms 43352 KB Output is correct
7 Correct 917 ms 43940 KB Output is correct
8 Correct 826 ms 37120 KB Output is correct
9 Correct 556 ms 32600 KB Output is correct
10 Correct 457 ms 29960 KB Output is correct
11 Correct 562 ms 32544 KB Output is correct
12 Correct 454 ms 29876 KB Output is correct
13 Correct 566 ms 33380 KB Output is correct
14 Correct 453 ms 30812 KB Output is correct
15 Correct 716 ms 31564 KB Output is correct
16 Correct 710 ms 33324 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 14940 KB Output is correct
2 Correct 4 ms 14940 KB Output is correct
3 Correct 3 ms 14940 KB Output is correct
4 Correct 4 ms 14940 KB Output is correct
5 Correct 3 ms 14940 KB Output is correct
6 Correct 4 ms 15196 KB Output is correct
7 Correct 3 ms 14940 KB Output is correct
8 Correct 472 ms 28852 KB Output is correct
9 Correct 542 ms 29100 KB Output is correct
10 Correct 672 ms 30464 KB Output is correct
11 Correct 823 ms 38360 KB Output is correct
12 Correct 960 ms 36732 KB Output is correct
13 Correct 862 ms 45112 KB Output is correct
14 Correct 641 ms 33272 KB Output is correct
15 Correct 601 ms 32508 KB Output is correct
16 Correct 4 ms 14936 KB Output is correct
17 Correct 5 ms 14940 KB Output is correct
18 Correct 5 ms 14940 KB Output is correct
19 Correct 5 ms 14936 KB Output is correct
20 Correct 761 ms 31948 KB Output is correct
21 Correct 972 ms 36848 KB Output is correct
22 Correct 1052 ms 37600 KB Output is correct
23 Correct 703 ms 34204 KB Output is correct
24 Correct 254 ms 24868 KB Output is correct
25 Correct 293 ms 30064 KB Output is correct
26 Correct 282 ms 28360 KB Output is correct
27 Correct 708 ms 33364 KB Output is correct
28 Correct 721 ms 34764 KB Output is correct
29 Correct 5 ms 14940 KB Output is correct
30 Correct 5 ms 14936 KB Output is correct
31 Correct 5 ms 14940 KB Output is correct
32 Correct 5 ms 14940 KB Output is correct
33 Correct 819 ms 38520 KB Output is correct
34 Correct 904 ms 43352 KB Output is correct
35 Correct 917 ms 43940 KB Output is correct
36 Correct 826 ms 37120 KB Output is correct
37 Correct 556 ms 32600 KB Output is correct
38 Correct 457 ms 29960 KB Output is correct
39 Correct 562 ms 32544 KB Output is correct
40 Correct 454 ms 29876 KB Output is correct
41 Correct 566 ms 33380 KB Output is correct
42 Correct 453 ms 30812 KB Output is correct
43 Correct 716 ms 31564 KB Output is correct
44 Correct 710 ms 33324 KB Output is correct
45 Correct 230 ms 23232 KB Output is correct
46 Correct 329 ms 23484 KB Output is correct
47 Correct 523 ms 27056 KB Output is correct
48 Correct 882 ms 38596 KB Output is correct
49 Correct 312 ms 30904 KB Output is correct
50 Correct 323 ms 29620 KB Output is correct
51 Correct 314 ms 30200 KB Output is correct
52 Correct 305 ms 28088 KB Output is correct
53 Correct 313 ms 30616 KB Output is correct
54 Correct 308 ms 29980 KB Output is correct