Submission #706014

#	Time	Username	Problem	Language	Result	Execution time	Memory
706014		600Mihnea	Street Lamps (APIO19_street_lamps)	C++17	20 / 100	5069 ms	48456 KiB

street_lamps

#include <cmath>
#include <functional>
#include <fstream>
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <map>
#include <list>
#include <time.h>
#include <math.h>
#include <random>
#include <deque>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <cassert>
#include <bitset>
#include <sstream>
#include <chrono>
#include <cstring>
#include <numeric>

using namespace std;

typedef long long ll;

struct T
{
	int i;
	int t1;
	int t2;
};

struct Q
{
	int l;
	int r;
	int iq;
};

struct Segment
{
	int l;
	int r;
	int x;
};

bool operator < (Segment a, Segment b)
{
	return make_pair(a.l, a.r) < make_pair(b.l, b.r);
}

struct Update
{
	int x;
	int y;
	ll val;
};

signed main()
{
#ifdef ONPC	
	FILE* stream;
	freopen_s(&stream, "input.txt", "r", stdin);
#else
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#endif

	int n, q;
	string init_config;
	cin >> n >> q >> init_config;
	assert((int)init_config.size() == n);
	for (auto& ch : init_config)
	{
		assert(ch == '0' || ch == '1');
	}
	vector<T> v;
	vector<int> since(n, 0);
	string cur_config = init_config;
	vector<vector<int>> ops(q);
	vector<int> printsol(q, -1);
	for (int iq = 0; iq < q; iq++)
	{
		string s;
		cin >> s;
		assert(s == "query" || s == "toggle");
		if (s == "query")
		{
			int l, r;
			cin >> l >> r;
			l--;
			r--;
			r--;
			assert(0 <= l && l <= r && r < n);
			ops[iq] = { l, r };
		}
		else
		{
			assert(s == "toggle");
			int i;
			cin >> i;
			i--;
			assert(0 <= i && i < n);
			cur_config[i] = '0' ^ '1' ^ cur_config[i];
			if (cur_config[i] == '1')
			{
				v.push_back({ i, since[i], iq - 1 + 1 });
			}
			else
			{
				since[i] = iq + 1;
			}
			ops[iq] = { i };
		}
	}
	for (int i = 0; i < n; i++)
	{
		if (cur_config[i] == '0')
		{
			v.push_back({ i, since[i], q });
		}
	}
	vector<Q> qs;

	for (int iq = 0; iq < q; iq++)
	{
		if ((int)ops[iq].size() == 2)
		{
			int l = ops[iq][0], r = ops[iq][1];
			qs.push_back({ l, r, iq });

		}
	}
	sort(v.begin(), v.end(), [&](T a, T b) {return a.i > b.i; });
	sort(qs.begin(), qs.end(), [&](Q a, Q b) {return a.l > b.l; });
	vector<int> last(q + 1, -1), what(q + 1, (int)1e9), coef(q + 1, 0);
	set<Segment> s;
	what[0] = -1;
	coef[0] = q + 1;
	s.insert({ 0, q, -1 });
	int pz = 0;
	vector<Update> updates;
	updates.push_back({ 0 + 1, what[0] + 1, coef[0] });
	for (auto& itqs : qs)
	{
		int l = itqs.l;
		vector<int> nr(q + 1, 0);
		int sol = 0;
		while (pz < (int)v.size() && l <= v[pz].i)
		{
			int st = v[pz].t1, dr = v[pz].t2;
			while (1)
			{
				auto it = s.lower_bound({ dr + 1, -1, 0 });
				if (it == s.begin())
				{
					break;
				}
				it--;
				assert(it->l <= dr);
				if (it->r < st)
				{
					break;
				}
				assert(it->l <= dr);
				assert(st <= it->r);
				vector<Segment> bg;
				if (dr + 1 <= it->r)
				{
					bg.push_back({ dr + 1, it->r, it->x });
				}
				if (it->l <= st - 1)
				{
					bg.push_back({ it->l, st - 1, it->x });
				}
				updates.push_back({ it->l + 1, what[it->l] + 1, -coef[it->l] });
				coef[it->l] = 0;
				s.erase(it);
				for (auto& gu : bg)
				{

					updates.push_back({ gu.l + 1, what[gu.l] + 1, -coef[gu.l] });
					what[gu.l] = gu.x;
					coef[gu.l] = gu.r - gu.l + 1;
					updates.push_back({ gu.l + 1, what[gu.l] + 1, +coef[gu.l] });
					s.insert(gu);
				}
			}
			updates.push_back({ st + 1, what[st] + 1, -coef[st] });
			what[st] = pz;
			coef[st] = dr - st + 1;
			updates.push_back({ st + 1, what[st] + 1, coef[st] });
			s.insert({ st, dr, pz });
			for (int j = st; j <= dr; j++)
			{
				last[j] = pz;
			}
			pz++;
		}
		int r = itqs.r, iq = itqs.iq;;
		///it2.i <= r
		/// 0 0 0 0 0 1 1 1 1 1 1 
		int Start = pz, low = 0, high = pz - 1;
		while (low <= high)
		{
			int jo = (low + high) / 2;
			if (v[jo].i <= r)
			{
				Start = jo;
				high = jo - 1;
			}
			else
			{
				low = jo + 1;
			}
		}
		auto it = s.lower_bound({ iq + 1, -1, 0 });
		assert(it != s.begin());
		it--;
		if (it->x <= Start - 1)
		{
			sol += iq - it->l + 1;
		}

		if (it != s.begin())
		{
			it--;
			int ant = it->l;
			for (auto& u : updates)
			{
				if (u.x <= ant + 1 && u.y <= Start)
				{
					sol += u.val;
				}
			}
		}
		printsol[iq] = sol;
		// erase if sure it is ok!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
		int ant = -1, sumdim = 0;
		for (auto& it : s)
		{
			assert(ant < it.l);
			assert(it.l <= it.r);
			sumdim += it.r - it.l + 1;
			ant = it.r;
		}
		assert(sumdim == q + 1);
		for (auto& u : updates)
		{
			assert(1 <= u.x && u.x <= q + 1);
		}
	}
	for (int iq = 0; iq < q; iq++)
	{
		if ((int)ops[iq].size() == 2)
		{
			cout << printsol[iq] << "\n";
		}
	}
	return 0;
}

• Subtask 1: 20 / 20
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 20
• Subtask 5: 0 / 20