#include <bits/stdc++.h>
using namespace std;
const int nx=3e5+5;
int n, q, lst[nx], sm[nx], l, a, b;
string s;
int main()
{
cin.tie(NULL)->sync_with_stdio(false);
cin>>n>>q>>s;
for (int i=1; i<=n; i++) lst[i]=(s[i-1]-'0')-1;
for (int i=1; i<=q; i++)
{
cin>>s;
if (s[0]=='t')
{
cin>>l;
if (lst[l]==-1) lst[l]=i;
else sm[l]+=(i-lst[l]-1), lst[l]=-1;
}
else
{
cin>>a>>b;
if (lst[a]!=-1) cout<<sm[a]+(i-lst[a])<<'\n';
else cout<<sm[a]<<'\n';
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
2392 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
46 ms |
3412 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
2396 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
2396 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
2392 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |