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 MAXN = 300010;
int n, q;
int ans[MAXN];
int last[MAXN];
string s;
int main()
{
cin >> n >> q;
cin >> s;
for(int i = 1 ; i <= q ; i++)
{
string type;
cin >> type;
if( type == "toggle" )
{
int ind;
cin >> ind; ind--;
if( s[ind] == '0' )
{
s[ind] = '1';
last[ind] = i;
}
else
{
s[ind] = '0';
ans[ind] += i - last[ind];
}
}
if( type == "query" )
{
int l, r;
cin >> l >> r; l--; r--;
if( s[l] == '1' )
{
ans[l] += i - last[l];
last[l] = i;
}
printf("%d\n",ans[l]);
}
}
}
# | 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... |