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;
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()
int main(){
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
ll n,q;
cin>>n>>q;
char s[n+5],cur[n+5];
for(ll i=1;i<=n;i++){
cin>>s[i];
}
vector<pair<ll,ll>>que(q);
for(ll i=0;i<q;i++){
string t;
cin>>t;
if(t=="toggle"){
ll j;
cin>>j;
que[i]={j,-1};
}
else{
ll a,b;
cin>>a>>b;
que[i]={a,b};
ll ans=0;
for(ll j=1;j<=n;j++){
cur[j]=s[j];
}
for(ll j=0;j<=i;j++){
bool ok=true;
for(ll k=a;k<b;k++){
if(cur[k]=='0'){
ok=false;
break;
}
}
if(ok){
ans++;
}
if(que[j].ss==-1){
ll p=que[j].ff;
if(cur[p]=='1') cur[p]='0';
else cur[p]='1';
}
}
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... |