oj.uz

Submission #721823

# Submission time Handle Problem Language Result Execution time Memory
721823 2023-04-11T07:38:35 Z LittleCube Street Lamps (APIO19_street_lamps) C++17
100 / 100
 4270 ms 278812 KB 
#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define F first
#define S second
using namespace std;

int N, Q, ans[300005], state[300005];
map<pii, int> mp;
vector<pair<pii, int>> in[300005], out[300005];
vector<pii> qu[300005];

void insert(int p, int t)
{
	auto rter = mp.upper_bound(pii(p, 0));
	auto lter = prev(rter);
	int l = p, r = p;
	if(rter != mp.end() && rter->F.F == p + 1)
	{
		auto [a, b] = rter->F;
	   	int s = rter->S;
		in[a].emplace_back(make_pair(pii(s, t), a));
		out[b].emplace_back(make_pair(pii(s, t), a));
		r = b;
		mp.erase(rter);
	}
	if(lter->F.S == p - 1)
	{
		auto [a, b] = lter->F; 
	   	int s = lter->S;
		in[a].emplace_back(make_pair(pii(s, t), a));
		out[b].emplace_back(make_pair(pii(s, t), a));
		l = a;
		mp.erase(lter);
	}
	mp[pii(l, r)] = t + 1;
}

void erase(int p, int t)
{
	auto iter = prev(mp.lower_bound(pii(p, N + 1)));
	auto [a, b] = iter->F;
    int s = iter->S;
	in[a].emplace_back(make_pair(pii(s, t), a));
	out[b].emplace_back(make_pair(pii(s, t), a));
	mp.erase(iter);
	if(a < p)
		mp[pii(a, p - 1)] = t + 1;
	if(p < b)
		mp[pii(p + 1, b)] = t + 1;
}

struct segTree
{
	vector<int> seg, l, r, lazy;
	vector<int> pos;
	int sz;
	inline int newnode()
	{
		seg.emplace_back(0);
		l.emplace_back(0);
		r.emplace_back(0);
		lazy.emplace_back(0);
		return (int)seg.size() - 1;
	}
	inline void apply(int val, int i, int L, int R)
	{
		lazy[i] += val;
		seg[i] += val * (pos[R] - pos[L]);
	}	
	void modify(int mL, int mR, int val, int i = 0, int L = 0, int R = - 1)
	{
		if(R == -1)
			R += sz;
		if(mL <= pos[L] && pos[R] <= mR)
			apply(val, i, L, R);
		else if(pos[R] <= mL || mR <= pos[L])
			return;
		else
		{
			int mid = (L + R) / 2;
			if(!l[i]) l[i] = newnode();
			if(!r[i]) r[i] = newnode();
			apply(lazy[i], l[i], L, mid);
			apply(lazy[i], r[i], mid, R);
			lazy[i] = 0;
			modify(mL, mR, val, l[i], L, mid);
			modify(mL, mR, val, r[i], mid, R);
			seg[i] = seg[l[i]] + seg[r[i]];
		}
	}
	int query(int mL, int mR, int i = 0, int L = 0, int R = -1)
	{
		if(R == -1)
			R += sz;
		if(mL <= pos[L] && pos[R] <= mR)
			return seg[i];
		else if(pos[R] <= mL || mR <= pos[L])
			return 0;
		else
		{
			int mid = (L + R) / 2;
			if(!l[i]) l[i] = newnode();
			if(!r[i]) r[i] = newnode();
			apply(lazy[i], l[i], L, mid);
			apply(lazy[i], r[i], mid, R);
			lazy[i] = 0;
			return query(mL, mR, l[i], L, mid) + query(mL, mR, r[i], mid, R);
		}
	}

} tree[300005];

signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	mp[pii(-2, -2)] = -1;
	cin >> N >> Q;
	for(int i = 1; i <= N; i++)
	{
		char c;
		cin >> c;
		state[i] = c - '0';
	}
	for (int i = 1; i <= N; i++)
		if(state[i])
		{
			int j = i;
			while(state[j + 1])
				j++;
			mp[pii(i, j)] = 1;
			i = j;
		}	
	for (int i = 1; i <= Q; i++)
	{
		string s;
		int a, b;
		cin >> s;
		if(s == "toggle")
		{
			ans[i] = -1;
			cin >> a;
			state[a] ^= 1;
			if(state[a])
				insert(a, i);
			else 
				erase(a, i);
		}
		else if(s == "query")
		{
			cin >> a >> b;
			b--;
			qu[b].emplace_back(pii(a, i));
		}
		//for (auto [p, v] : mp)
		//	cerr << "(" << p.F << ", " << p.S << ") " << v << "  ";
		//cerr << '\n';
	}
	mp.erase(mp.begin());
	for (auto [p, v] : mp)
	{
		auto [a, b] = p;
		in[a].emplace_back(make_pair(pii(v, Q), a));
		out[b].emplace_back(make_pair(pii(v, Q), a));
	}

	
	for (int i = 1; i <= N; i++)
	{
		for (auto [p, k] : in[i])
		{
			auto [l, r] = p;
			//cerr << l << ' ' << r << ' ' << k << ' ' << i << '\n';
			for (; k <= N; k += (k & -k))
				tree[k].pos.emplace_back(l), tree[k].pos.emplace_back(r + 1);
		}

		for (auto [r, j] : qu[i])
		{
			for (; r > 0; r -= (r & -r))
				tree[r].pos.emplace_back(j + 1);
		}
	}

	for (int i = 1; i <= N; i++)
	{	
		tree[i].newnode();
		sort(tree[i].pos.begin(), tree[i].pos.end());
		tree[i].pos.resize(unique(tree[i].pos.begin(), tree[i].pos.end()) - tree[i].pos.begin());
		tree[i].sz = tree[i].pos.size();
	}

	for (int i = 1; i <= N; i++)
	{
		for (auto [p, k] : in[i])
		{
			auto [l, r] = p;
			//cerr << l << ' ' << r << ' ' << k << ' ' << i << '\n';
			for (; k <= N; k += (k & -k))
				tree[k].modify(l, r + 1, 1);
		}
		
		for (auto [r, j] : qu[i])
		{
			for (; r > 0; r -= (r & -r))
				ans[j] += tree[r].query(0, j + 1);
		}

		for (auto [p, k] : out[i])
		{
			auto [l, r] = p;
			//cerr << l << ' ' << r << ' ' << k << ' ' << i <<  " out " << '\n';
			for (; k <= N; k += (k & -k))
				tree[k].modify(l, r + 1, -1);

		}


	}
	for (int i = 1; i <= Q; i++)
		if(ans[i] >= 0)
			cout << ans[i] << '\n';
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 59004 KB Output is correct
2 Correct 35 ms 59036 KB Output is correct
3 Correct 33 ms 59040 KB Output is correct
4 Correct 33 ms 59028 KB Output is correct
5 Correct 32 ms 59024 KB Output is correct
6 Correct 35 ms 58964 KB Output is correct
7 Correct 33 ms 59052 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 992 ms 116700 KB Output is correct
2 Correct 1206 ms 135372 KB Output is correct
3 Correct 1803 ms 163928 KB Output is correct
4 Correct 2989 ms 263532 KB Output is correct
5 Correct 3088 ms 258892 KB Output is correct
6 Correct 3081 ms 270740 KB Output is correct
7 Correct 1288 ms 220204 KB Output is correct
8 Correct 1312 ms 222292 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 59468 KB Output is correct
2 Correct 38 ms 59392 KB Output is correct
3 Correct 41 ms 59440 KB Output is correct
4 Correct 34 ms 59340 KB Output is correct
5 Correct 3824 ms 263948 KB Output is correct
6 Correct 4091 ms 260468 KB Output is correct
7 Correct 3838 ms 248488 KB Output is correct
8 Correct 2652 ms 210956 KB Output is correct
9 Correct 535 ms 93992 KB Output is correct
10 Correct 551 ms 95724 KB Output is correct
11 Correct 619 ms 97992 KB Output is correct
12 Correct 2520 ms 209088 KB Output is correct
13 Correct 2488 ms 210884 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 59340 KB Output is correct
2 Correct 39 ms 59472 KB Output is correct
3 Correct 36 ms 59524 KB Output is correct
4 Correct 43 ms 59444 KB Output is correct
5 Correct 2817 ms 237608 KB Output is correct
6 Correct 3373 ms 251060 KB Output is correct
7 Correct 3856 ms 265544 KB Output is correct
8 Correct 4270 ms 278812 KB Output is correct
9 Correct 1611 ms 141524 KB Output is correct
10 Correct 1323 ms 131468 KB Output is correct
11 Correct 1626 ms 141916 KB Output is correct
12 Correct 1396 ms 132020 KB Output is correct
13 Correct 1573 ms 141948 KB Output is correct
14 Correct 1385 ms 132208 KB Output is correct
15 Correct 2799 ms 211772 KB Output is correct
16 Correct 2642 ms 213052 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 59004 KB Output is correct
2 Correct 35 ms 59036 KB Output is correct
3 Correct 33 ms 59040 KB Output is correct
4 Correct 33 ms 59028 KB Output is correct
5 Correct 32 ms 59024 KB Output is correct
6 Correct 35 ms 58964 KB Output is correct
7 Correct 33 ms 59052 KB Output is correct
8 Correct 992 ms 116700 KB Output is correct
9 Correct 1206 ms 135372 KB Output is correct
10 Correct 1803 ms 163928 KB Output is correct
11 Correct 2989 ms 263532 KB Output is correct
12 Correct 3088 ms 258892 KB Output is correct
13 Correct 3081 ms 270740 KB Output is correct
14 Correct 1288 ms 220204 KB Output is correct
15 Correct 1312 ms 222292 KB Output is correct
16 Correct 36 ms 59468 KB Output is correct
17 Correct 38 ms 59392 KB Output is correct
18 Correct 41 ms 59440 KB Output is correct
19 Correct 34 ms 59340 KB Output is correct
20 Correct 3824 ms 263948 KB Output is correct
21 Correct 4091 ms 260468 KB Output is correct
22 Correct 3838 ms 248488 KB Output is correct
23 Correct 2652 ms 210956 KB Output is correct
24 Correct 535 ms 93992 KB Output is correct
25 Correct 551 ms 95724 KB Output is correct
26 Correct 619 ms 97992 KB Output is correct
27 Correct 2520 ms 209088 KB Output is correct
28 Correct 2488 ms 210884 KB Output is correct
29 Correct 36 ms 59340 KB Output is correct
30 Correct 39 ms 59472 KB Output is correct
31 Correct 36 ms 59524 KB Output is correct
32 Correct 43 ms 59444 KB Output is correct
33 Correct 2817 ms 237608 KB Output is correct
34 Correct 3373 ms 251060 KB Output is correct
35 Correct 3856 ms 265544 KB Output is correct
36 Correct 4270 ms 278812 KB Output is correct
37 Correct 1611 ms 141524 KB Output is correct
38 Correct 1323 ms 131468 KB Output is correct
39 Correct 1626 ms 141916 KB Output is correct
40 Correct 1396 ms 132020 KB Output is correct
41 Correct 1573 ms 141948 KB Output is correct
42 Correct 1385 ms 132208 KB Output is correct
43 Correct 2799 ms 211772 KB Output is correct
44 Correct 2642 ms 213052 KB Output is correct
45 Correct 400 ms 86084 KB Output is correct
46 Correct 704 ms 101212 KB Output is correct
47 Correct 1978 ms 167668 KB Output is correct
48 Correct 3682 ms 261556 KB Output is correct
49 Correct 674 ms 103288 KB Output is correct
50 Correct 645 ms 101792 KB Output is correct
51 Correct 786 ms 105768 KB Output is correct
52 Correct 1180 ms 117808 KB Output is correct
53 Correct 1129 ms 117448 KB Output is correct
54 Correct 1180 ms 117400 KB Output is correct