This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
const int N = 101;
bool a[N][N];
signed main() {
#ifdef HOME
freopen("input.txt", "r", stdin);
#else
ios_base::sync_with_stdio(0); cin.tie(0);
#endif
int n, q;
cin >> n >> q;
for (int i = 0; i < n; ++i) {
char c;
cin >> c;
a[0][i] = c == '1';
}
for (int i = 0; i < q; ++i) {
for (int j = 0; j < n; ++j) {
a[i + 1][j] = a[i][j];
}
string t;
cin >> t;
if (t == "toggle") {
int p;
cin >> p;
--p;
a[i + 1][p] ^= 1;
}
else {
int l, r;
cin >> l >> r;
--r;
--l; --r;
int ans = 0;
for (int j = 0; j <= i; ++j) {
bool add = 1;
for (int k = l; k <= r; ++k) {
add &= a[j][k];
}
ans += add;
}
cout << ans << '\n';
}
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |