Submission #254804

#TimeUsernameProblemLanguageResultExecution timeMemory
254804LawlietStreet Lamps (APIO19_street_lamps)C++17
0 / 100
2 ms640 KiB
#include <bits/stdc++.h>

using namespace std;

const int MAXN = 110;

int n, q;

string v[MAXN];

int main()
{
	cin >> n >> q;
	cin >> v[1];

	for(int i = 1 ; i <= q ; i++)
	{
		string type;
		cin >> type;

		v[i + 1] = v[i];

		if( type == "toggle" )
		{
			int ind;
			cin >> ind; ind--;

			v[i + 1][ind] = '1' - v[i][ind];
		}
		if( type == "query" )
		{
			int l, r;
			cin >> l >> r; l--; r--;

			int ans = 0;

			for(int t = 1 ; t <= i ; t++)
			{
				bool flag = true;

				for(int j = l ; j < r ; j++)
					if( v[t][j] == '0' ) flag = false;

				if( flag ) ans++;
			}

			printf("%d\n",ans);
		}
	}
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...