#include <bits/stdc++.h>
using namespace std;
const int mxN = 107;
int n, q, cnt[mxN][mxN], arr[mxN];
int32_t main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n >> q;
for (int i = 1; i <= n; ++i) {
char c;
cin >> c;
if (c == '1') {
arr[i] = 1;
}
}
while (q--) {
for (int i = 1; i <= n; ++i) {
for (int j = i+1; j <= n; ++j) {
if (!arr[j-1]) {
break;
}
cnt[i][j]++;
}
}
string t;
cin >> t;
if (t[0] == 'q') {
int a, b;
cin >> a >> b;
cout << cnt[a][b] << "\n";
}
else {
int ind;
cin >> ind;
arr[ind] ^= 1;
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
139 ms |
1360 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
604 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
604 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |