#include <bits/stdc++.h>
using namespace std;
const int maxn = (int)3e5+10;
string s;
int n, q, a[maxn], cnt[maxn], t[maxn];
int32_t main() {
ios_base::sync_with_stdio(false); cin.tie(0);
cin >> n >> q >> s;
for(int i = 1; i <= n; i++){
a[i] = (s[i-1]=='1');
t[i] = (a[i]==1?0:-1);
}
for(int i = 1; i <= q; i++){
int x, y; cin >> s >> x;
if(s[0]=='t'){
a[x]^=1;
if(a[x]) t[x]=i;
else cnt[x]+=i-t[x];
}
else cin >> y, cout << cnt[x]+a[x]*(i-t[x]) << "\n";
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
59 ms |
4444 KB |
Output is correct |
2 |
Correct |
66 ms |
4716 KB |
Output is correct |
3 |
Correct |
66 ms |
5256 KB |
Output is correct |
4 |
Correct |
84 ms |
10080 KB |
Output is correct |
5 |
Correct |
77 ms |
9288 KB |
Output is correct |
6 |
Correct |
72 ms |
9748 KB |
Output is correct |
7 |
Correct |
96 ms |
9508 KB |
Output is correct |
8 |
Correct |
133 ms |
10944 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |