// APIOi.cpp : This file contains the 'main' function. Program execution begins and ends there.
//
#include <iostream>
using namespace std;
#include<bitset>
#include<vector>
#define vi vector<int>
int main()
{
int n, q;
cin >> n >> q;
const int siz = 3e5;
bitset<siz> b;
string s;
cin >> s;
vector<vi> ans(n,vi(n));
for (int i = 0; i < n; i++)b[i] = (s[i] == '1');
for (int i = 1; i <= q; i++) {
string st;
cin >> st;
for (int j = 0; j < n; j++) {
for (int k = j; k < n; k++) {
if (b[k] == 0)break;
ans[j][k]++;
}
}
if (st == "toggle") {
int in;
cin >> in;
in--;
/*if (!b[in])ans[in] -= i;
else ans[in] += i;*/
b[in] = !b[in];
}
else {
int x, y;
cin >> x >> y;
x--, y -= 2;
cout << ans[x][y] << "\n";
}
}
}
// Run program: Ctrl + F5 or Debug > Start Without Debugging menu
// Debug program: F5 or Debug > Start Debugging menu
// Tips for Getting Started:
// 1. Use the Solution Explorer window to add/manage files
// 2. Use the Team Explorer window to connect to source control
// 3. Use the Output window to see build output and other messages
// 4. Use the Error List window to view errors
// 5. Go to Project > Add New Item to create new code files, or Project > Add Existing Item to add existing code files to the project
// 6. In the future, to open this project again, go to File > Open > Project and select the .sln file
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
1 ms |
340 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
2 ms |
340 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
456 ms |
1240 KB |
Output is correct |
2 |
Correct |
716 ms |
1616 KB |
Output is correct |
3 |
Execution timed out |
5036 ms |
99004 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
11 ms |
4180 KB |
Output is correct |
2 |
Correct |
14 ms |
4180 KB |
Output is correct |
3 |
Correct |
23 ms |
4180 KB |
Output is correct |
4 |
Correct |
470 ms |
4180 KB |
Output is correct |
5 |
Runtime error |
301 ms |
524288 KB |
Execution killed with signal 9 |
6 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
10 ms |
4180 KB |
Output is correct |
2 |
Correct |
9 ms |
4216 KB |
Output is correct |
3 |
Correct |
8 ms |
4180 KB |
Output is correct |
4 |
Correct |
8 ms |
4292 KB |
Output is correct |
5 |
Runtime error |
210 ms |
524288 KB |
Execution killed with signal 9 |
6 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
1 ms |
340 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
2 ms |
340 KB |
Output is correct |
8 |
Correct |
456 ms |
1240 KB |
Output is correct |
9 |
Correct |
716 ms |
1616 KB |
Output is correct |
10 |
Execution timed out |
5036 ms |
99004 KB |
Time limit exceeded |
11 |
Halted |
0 ms |
0 KB |
- |