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;
int List[105][105];
int main(){
int N,Q;
cin>>N>>Q;
for(int i=1;i<=N;i++){
char s;
cin>>s;
List[0][i]=s-'0';
}
int sp=-1;
for(int i=1;i<=Q;i++){
string s;
int a,b;
cin>>s;
for(int j=1;j<=N;j++){
List[i][j]=List[i-1][j];
}
if(sp!=-1) List[i-1][sp]=1-List[i-1][sp];
if(s=="query"){
sp = -1;
cin>>a>>b;
int answer = 0;
for(int j=1;j<=i;j++){
int flag = 1;
for(int k=a;k<b;k++){
if(!List[j][k]) flag = 0;
}
answer += flag;
}
cout << answer << "\n";
}
else{
cin>>a;
List[i][a]=1-List[i][a];
sp = a;
}
}
}
# | 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... |