Submission #167546

#	Time	Username	Problem	Language	Result	Execution time	Memory
167546		qkxwsm	Street Lamps (APIO19_street_lamps)	C++14	20 / 100	64 ms	2936 KiB

street_lamps

#include <bits/stdc++.h>

using namespace std;

template<class T, class U>
void ckmin(T &a, U b)
{
	if (a > b) a = b;
}

template<class T, class U>
void ckmax(T &a, U b)
{
	if (a < b) a = b;
}

#define MP make_pair
#define PB push_back
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define FOR(i, a, b) for (auto i = (a); i < (b); i++)
#define FORD(i, a, b) for (auto i = (a) - 1; i >= (b); i--)
#define SZ(x) ((int) (x).size())
#define ALL(x) (x).begin(), (x).end()
#define MAXN 300013

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpi;
typedef vector<pll> vpl;

int N, Q;
bitset<113> state[113];
pii quer[MAXN];

int32_t main()
{
	ios_base::sync_with_stdio(false); cin.tie(0);
	cout << fixed << setprecision(12);
	cerr << fixed << setprecision(4);
	cin >> N >> Q;
	string temps; cin >> temps;
	FOR(i, 0, SZ(temps))
	{
		state[0][i] = (temps[i] == '1');
	}
	FOR(i, 0, Q)
	{
		cin >> temps;
		int x, y;
		if (temps[0] == 't')
		{
			cin >> x; x--;
			quer[i] = {-1, x};
		}
		else
		{
			cin >> x >> y; x--; y -= 2;
			quer[i] = {x, y};
		}
	}
	FOR(i, 0, Q)
	{
		state[i + 1] = state[i];
		if (quer[i].fi == -1)
		{
			state[i + 1][quer[i].se] = state[i + 1][quer[i].se] ^ 1;
		}
		else
		{
			int sum = 0;
			FOR(j, 0, i + 1)
			{
				bool ok = true;
				FOR(k, quer[i].fi, quer[i].se + 1)
				{
					ok &= state[j][k];
				}
				sum += ok;
			}
			cout << sum << '\n';
		}
	}
	return 0;
}

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