oj.uz

Submission #276613

# Submission time Handle Problem Language Result Execution time Memory
276613 2020-08-20T14:22:23 Z srvlt Street Lamps (APIO19_street_lamps) C++14
100 / 100
 2643 ms 53688 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define all(x) begin(x), end(x)
#define SZ(x) (int)(x).size()
#define cps(x) sort(all(x)), (x).erase(unique(all(x)), end(x))
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
 
const int n0 = 3e5 + 123;
int N, q, fen[n0];
char s[n0], s0[n0];
 
void upd(int x, int y) {
	for (; x <= N; x |= (x + 1)) fen[x] += y;
}
 
int get(int x) {
	int res = 0;
	for (; x >= 0; x = (x & (x + 1)) - 1) res += fen[x];
	return res;
}
 
int get_left(int x) {
	int l = 0, r = x;
	while (l < r - 1) {
		int mid = l + r >> 1;
		if (get(x) - get(mid - 1) == x - mid + 1) r = mid;
		else l = mid;
	}
	return r;
}
 
int get_right(int x) {
	int l = x, r = N + 1;
	while (l < r - 1) {
		int mid = l + r >> 1;
		if (get(mid) - get(x - 1) == mid - x + 1) l = mid;
		else r = mid;
	}
	return l;
}
 
struct Fen {
	int n, s = 0;
	vector <int> xv, val;
	int pos(int x) {
		return (int)(lower_bound(all(xv), x) - begin(xv));
	}
	void add(int x) {
		xv.pb(x);
	}
	void init() {
		cps(xv);
		n = SZ(xv);
		val.resize(n);
	}
	void upd(int x, int y) {
		x = pos(x);
		s += y;
		for (; x < n; x |= (x + 1)) val[x] += y;
	}
	int getsum(int x) {
		x = pos(x) - 1;
		int res = 0;
		for (; x >= 0; x = (x & (x + 1)) - 1) res += val[x];
		return s - res;
	}
};
 
struct Fen2D {
	int n;
	vector <int> xv;
	vector <array <int, 2>> pt;
	vector <Fen> nd;
	int pos(int x) {
		return (int)(lower_bound(all(xv), x) - begin(xv));
	}
	void add(int x, int y) {
		xv.pb(x);
		pt.pb({x, y});
	}
	void reserve(int x, int y) {
		x = pos(x);
		for (; x < n; x |= (x + 1))
			nd[x].add(y);
	}
	void init() {
		cps(xv);
		n = SZ(xv);
		nd.resize(n);
		for (auto & i : pt)
			reserve(i[0], i[1]);
		for (int i = 0; i < n; i++)
			nd[i].init();
	}
	void upd(int x, int y, int val) {
		x = pos(x);
		for (; x < n; x |= (x + 1))
			nd[x].upd(y, val);
	}
	int getsum(int x, int y) {
		x = pos(x + 1) - 1;
		int res = 0;
		for (; x >= 0; x = (x & (x + 1)) - 1)
			res += nd[x].getsum(y);
		return res;
	}
};
Fen2D lamps;
int qr[n0][3];
 
void toggle(int x) {
	if (s[x] == '1') {
		s[x] = '0';
		upd(x, -1);
	}	else {
		s[x] = '1';
		upd(x, 1);
	}
}
 
int main() {
	ios_base::sync_with_stdio(false), cin.tie(NULL);
	cin >> N >> q;
	for (int i = 1; i <= N; i++) {
		cin >> s[i];
		s0[i] = s[i];
		if (s[i] == '1') upd(i, 1);
	}
	for (int i = 1; i <= N; i++) {
		if (s[i] == '0') continue;
		if (i == N || s[i + 1] == '0') {
			int l = get_left(i);
			lamps.add(l, i);
		}
	}
	string tp;
	for (int i = 1; i <= q; i++) {
		cin >> tp;
		if (tp == "query") {
			qr[i][0] = 1;
			cin >> qr[i][1] >> qr[i][2];
		}	else {
			qr[i][0] = 2;
			cin >> qr[i][1];
			int x = qr[i][1];
			if (s[x] == '1') {
				toggle(x);
				if (s[x - 1] == '1') {
					int l = get_left(x - 1);
					lamps.add(l, x - 1);
				}
				if (s[x + 1] == '1') {
					int r = get_right(x + 1);
					lamps.add(x + 1, r);
				}
			}	else {
				toggle(x);
				int l = get_left(x);
				int r = get_right(x);
				lamps.add(l, r);
			}
		}
	}
	lamps.init();
	memset(& fen, 0, sizeof(fen));
	for (int i = 1; i <= N; i++) {
		s[i] = s0[i];
		if (s[i] == '1') upd(i, 1);
	}
	for (int i = 1; i <= N; i++) {
		if (s[i] == '0') continue;
		if (i == N || s[i + 1] == '0') {
			int l = get_left(i);
			lamps.upd(l, i, q);
		}
	}
	for (int i = 1; i <= q; i++) {
		if (qr[i][0] == 1) {
			int l = qr[i][1], r = qr[i][2];
			r--;
			int res = 0;
			if (get(r) - get(l - 1) == r - l + 1)
				res -= (q - i);
			res += lamps.getsum(l, r);
			cout << res << '\n';
		}	else {
			int x = qr[i][1];
			if (s[x] == '1') {
				int l = get_left(x), r = get_right(x);
				lamps.upd(l, r, -(q - i));
				toggle(x);
				if (s[x - 1] == '1')
					lamps.upd(l, x - 1, q - i);
				if (s[x + 1] == '1')
					lamps.upd(x + 1, r, q - i);
			}	else {
				int l = x, r = x;
				if (s[x - 1] == '1') {
					l = get_left(x - 1);
					lamps.upd(l, x - 1, -(q - i));
				}
				if (s[x + 1] == '1') {
					r = get_right(x + 1);
					lamps.upd(x + 1, r, -(q - i));
				}
				toggle(x);
				lamps.upd(l, r, q - i);
			}
		}
	}
}

Compilation message

street_lamps.cpp: In function 'int get_left(int)':
street_lamps.cpp:28:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   28 |   int mid = l + r >> 1;
      |             ~~^~~
street_lamps.cpp: In function 'int get_right(int)':
street_lamps.cpp:38:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   38 |   int mid = l + r >> 1;
      |             ~~^~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1536 KB Output is correct
2 Correct 1 ms 1536 KB Output is correct
3 Correct 1 ms 1536 KB Output is correct
4 Correct 1 ms 1536 KB Output is correct
5 Correct 1 ms 1536 KB Output is correct
6 Correct 1 ms 1536 KB Output is correct
7 Correct 1 ms 1536 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 257 ms 10592 KB Output is correct
2 Correct 356 ms 11124 KB Output is correct
3 Correct 608 ms 13044 KB Output is correct
4 Correct 1743 ms 37088 KB Output is correct
5 Correct 1689 ms 30104 KB Output is correct
6 Correct 2154 ms 39848 KB Output is correct
7 Correct 139 ms 6268 KB Output is correct
8 Correct 146 ms 7672 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1664 KB Output is correct
2 Correct 3 ms 1664 KB Output is correct
3 Correct 3 ms 1664 KB Output is correct
4 Correct 1 ms 1536 KB Output is correct
5 Correct 2429 ms 43836 KB Output is correct
6 Correct 2354 ms 41032 KB Output is correct
7 Correct 1762 ms 29948 KB Output is correct
8 Correct 156 ms 7672 KB Output is correct
9 Correct 101 ms 5240 KB Output is correct
10 Correct 106 ms 5496 KB Output is correct
11 Correct 114 ms 5624 KB Output is correct
12 Correct 166 ms 6264 KB Output is correct
13 Correct 174 ms 7672 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1536 KB Output is correct
2 Correct 3 ms 1664 KB Output is correct
3 Correct 3 ms 1696 KB Output is correct
4 Correct 4 ms 1664 KB Output is correct
5 Correct 603 ms 21608 KB Output is correct
6 Correct 1212 ms 30500 KB Output is correct
7 Correct 1792 ms 39148 KB Output is correct
8 Correct 2643 ms 53688 KB Output is correct
9 Correct 410 ms 15840 KB Output is correct
10 Correct 359 ms 15820 KB Output is correct
11 Correct 418 ms 17500 KB Output is correct
12 Correct 344 ms 17040 KB Output is correct
13 Correct 413 ms 17548 KB Output is correct
14 Correct 351 ms 17228 KB Output is correct
15 Correct 133 ms 12184 KB Output is correct
16 Correct 147 ms 13560 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1536 KB Output is correct
2 Correct 1 ms 1536 KB Output is correct
3 Correct 1 ms 1536 KB Output is correct
4 Correct 1 ms 1536 KB Output is correct
5 Correct 1 ms 1536 KB Output is correct
6 Correct 1 ms 1536 KB Output is correct
7 Correct 1 ms 1536 KB Output is correct
8 Correct 257 ms 10592 KB Output is correct
9 Correct 356 ms 11124 KB Output is correct
10 Correct 608 ms 13044 KB Output is correct
11 Correct 1743 ms 37088 KB Output is correct
12 Correct 1689 ms 30104 KB Output is correct
13 Correct 2154 ms 39848 KB Output is correct
14 Correct 139 ms 6268 KB Output is correct
15 Correct 146 ms 7672 KB Output is correct
16 Correct 4 ms 1664 KB Output is correct
17 Correct 3 ms 1664 KB Output is correct
18 Correct 3 ms 1664 KB Output is correct
19 Correct 1 ms 1536 KB Output is correct
20 Correct 2429 ms 43836 KB Output is correct
21 Correct 2354 ms 41032 KB Output is correct
22 Correct 1762 ms 29948 KB Output is correct
23 Correct 156 ms 7672 KB Output is correct
24 Correct 101 ms 5240 KB Output is correct
25 Correct 106 ms 5496 KB Output is correct
26 Correct 114 ms 5624 KB Output is correct
27 Correct 166 ms 6264 KB Output is correct
28 Correct 174 ms 7672 KB Output is correct
29 Correct 3 ms 1536 KB Output is correct
30 Correct 3 ms 1664 KB Output is correct
31 Correct 3 ms 1696 KB Output is correct
32 Correct 4 ms 1664 KB Output is correct
33 Correct 603 ms 21608 KB Output is correct
34 Correct 1212 ms 30500 KB Output is correct
35 Correct 1792 ms 39148 KB Output is correct
36 Correct 2643 ms 53688 KB Output is correct
37 Correct 410 ms 15840 KB Output is correct
38 Correct 359 ms 15820 KB Output is correct
39 Correct 418 ms 17500 KB Output is correct
40 Correct 344 ms 17040 KB Output is correct
41 Correct 413 ms 17548 KB Output is correct
42 Correct 351 ms 17228 KB Output is correct
43 Correct 133 ms 12184 KB Output is correct
44 Correct 147 ms 13560 KB Output is correct
45 Correct 100 ms 9064 KB Output is correct
46 Correct 171 ms 9496 KB Output is correct
47 Correct 720 ms 22500 KB Output is correct
48 Correct 1631 ms 42208 KB Output is correct
49 Correct 110 ms 9208 KB Output is correct
50 Correct 109 ms 9080 KB Output is correct
51 Correct 109 ms 9336 KB Output is correct
52 Correct 116 ms 9720 KB Output is correct
53 Correct 111 ms 9592 KB Output is correct
54 Correct 113 ms 9592 KB Output is correct