oj.uz

Submission #276629

# Submission time Handle Problem Language Result Execution time Memory
276629 2020-08-20T14:32:20 Z srvlt Street Lamps (APIO19_street_lamps) C++14
100 / 100
 2859 ms 61944 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];
set <int> st;

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) {
	auto it = st.upper_bound(x);
	if (it == st.begin()) return 1;
	--it;
	return *it + 1;
}
 
int get_right(int x) {
	auto it = st.upper_bound(x);
	if (it == st.end()) return N;
	return *it - 1;
}
 
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);
		st.insert(x);
	}	else {
		s[x] = '1';
		upd(x, 1);
		st.erase(x);
	}
}
 
int main() {
	ios_base::sync_with_stdio(false), cin.tie(NULL);
	cin >> N >> q;
	for (int i = 1; i <= N; i++) {
		st.insert(i);
		cin >> s[i];
		s0[i] = s[i];
		if (s[i] == '1') upd(i, 1), st.erase(i);
	}
	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));
	st.clear();
	for (int i = 1; i <= N; i++) {
		st.insert(i);
		s[i] = s0[i];
		if (s[i] == '1') upd(i, 1), st.erase(i);
	}
	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);
			}
		}
	}
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 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 271 ms 11872 KB Output is correct
2 Correct 332 ms 11484 KB Output is correct
3 Correct 546 ms 13664 KB Output is correct
4 Correct 1903 ms 44664 KB Output is correct
5 Correct 1611 ms 36260 KB Output is correct
6 Correct 1950 ms 47376 KB Output is correct
7 Correct 258 ms 20856 KB Output is correct
8 Correct 180 ms 8056 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1664 KB Output is correct
2 Correct 4 ms 1664 KB Output is correct
3 Correct 4 ms 1664 KB Output is correct
4 Correct 2 ms 1536 KB Output is correct
5 Correct 2698 ms 59360 KB Output is correct
6 Correct 2333 ms 52048 KB Output is correct
7 Correct 1516 ms 36748 KB Output is correct
8 Correct 187 ms 8824 KB Output is correct
9 Correct 94 ms 6520 KB Output is correct
10 Correct 105 ms 6144 KB Output is correct
11 Correct 105 ms 6136 KB Output is correct
12 Correct 256 ms 20728 KB Output is correct
13 Correct 190 ms 8104 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1664 KB Output is correct
2 Correct 3 ms 1664 KB Output is correct
3 Correct 4 ms 1664 KB Output is correct
4 Correct 5 ms 1664 KB Output is correct
5 Correct 698 ms 29800 KB Output is correct
6 Correct 1237 ms 38684 KB Output is correct
7 Correct 1914 ms 47456 KB Output is correct
8 Correct 2859 ms 61944 KB Output is correct
9 Correct 420 ms 15540 KB Output is correct
10 Correct 409 ms 15440 KB Output is correct
11 Correct 424 ms 14760 KB Output is correct
12 Correct 374 ms 14800 KB Output is correct
13 Correct 404 ms 14944 KB Output is correct
14 Correct 361 ms 14832 KB Output is correct
15 Correct 262 ms 21080 KB Output is correct
16 Correct 212 ms 8312 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 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 271 ms 11872 KB Output is correct
9 Correct 332 ms 11484 KB Output is correct
10 Correct 546 ms 13664 KB Output is correct
11 Correct 1903 ms 44664 KB Output is correct
12 Correct 1611 ms 36260 KB Output is correct
13 Correct 1950 ms 47376 KB Output is correct
14 Correct 258 ms 20856 KB Output is correct
15 Correct 180 ms 8056 KB Output is correct
16 Correct 3 ms 1664 KB Output is correct
17 Correct 4 ms 1664 KB Output is correct
18 Correct 4 ms 1664 KB Output is correct
19 Correct 2 ms 1536 KB Output is correct
20 Correct 2698 ms 59360 KB Output is correct
21 Correct 2333 ms 52048 KB Output is correct
22 Correct 1516 ms 36748 KB Output is correct
23 Correct 187 ms 8824 KB Output is correct
24 Correct 94 ms 6520 KB Output is correct
25 Correct 105 ms 6144 KB Output is correct
26 Correct 105 ms 6136 KB Output is correct
27 Correct 256 ms 20728 KB Output is correct
28 Correct 190 ms 8104 KB Output is correct
29 Correct 2 ms 1664 KB Output is correct
30 Correct 3 ms 1664 KB Output is correct
31 Correct 4 ms 1664 KB Output is correct
32 Correct 5 ms 1664 KB Output is correct
33 Correct 698 ms 29800 KB Output is correct
34 Correct 1237 ms 38684 KB Output is correct
35 Correct 1914 ms 47456 KB Output is correct
36 Correct 2859 ms 61944 KB Output is correct
37 Correct 420 ms 15540 KB Output is correct
38 Correct 409 ms 15440 KB Output is correct
39 Correct 424 ms 14760 KB Output is correct
40 Correct 374 ms 14800 KB Output is correct
41 Correct 404 ms 14944 KB Output is correct
42 Correct 361 ms 14832 KB Output is correct
43 Correct 262 ms 21080 KB Output is correct
44 Correct 212 ms 8312 KB Output is correct
45 Correct 111 ms 7656 KB Output is correct
46 Correct 172 ms 7908 KB Output is correct
47 Correct 803 ms 22296 KB Output is correct
48 Correct 1815 ms 44692 KB Output is correct
49 Correct 115 ms 6336 KB Output is correct
50 Correct 116 ms 6392 KB Output is correct
51 Correct 111 ms 6392 KB Output is correct
52 Correct 116 ms 6392 KB Output is correct
53 Correct 135 ms 6392 KB Output is correct
54 Correct 118 ms 6392 KB Output is correct