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 = 1e5+10;
typedef pair<int, bool> pii;
int n, q;
pii last[maxn];
int main(){
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
cin >> n >> q;
for(int i=1; i<=n; i++){
char a;
cin >> a;
last[i] = {0, bool(a-'0')};
}
for(int t=1; t<=q; t++){
string op;
cin >> op;
if(op[0] == 'q'){
int a, b;
cin >> a >> b;
bool ok = true;
int ans = 0;
for(int i=a; i<b; i++){
if(!last[i].second) ok = false;
ans = max(ans, last[i].first);
}
if(!ok) cout << 0 << endl;
else cout << t-ans << endl;
}
else{
int i;
cin >> i;
last[i].first = t, last[i].second ^= 1;
}
}
return 0;
}
# | 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... |