#include<bits/stdc++.h>
#define st first
#define nd second
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define eb emplace_back
#define pp pop_back
#define mp make_pair
using namespace std;
using pii = pair<int, int>;
using ll = long long;
using vi = vector<int>;
using vii = vector<pii>;
void debug(){cerr<<"\n";}
template<typename H, typename... T>
void debug(H h, T... t){
cerr<<h;
if(sizeof...(t)){
cerr<<", ";
}
debug(t...);
}
#define deb(x...) cerr<<#x<<" = ";debug(x);
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
const int N=1<<19;
vi todo[N];
int pref[N+N], suf[N+N], L[N+N], R[N+N], siz[N+N], M[N], tim[N+N];
int male[N];
int ans[N], typ[N];
vector<pair<pii, pii> > U[N];
vector<pair<int, pii> > Q[N];
void upd(int v){
int l=v+v, r=v+v+1;
if(pref[l]==siz[l])pref[v]=pref[r]+siz[l];
else pref[v]=pref[l];
if(suf[r]==siz[r])suf[v]=suf[l]+siz[r];
else suf[v]=suf[r];
}
int tab[N+N];
void add(int v, int c){
for(v+=N; v>0; v>>=1){
tab[v]+=c;
}
}
int sum(int l, int r){
int res=0;
for(l+=N, r+=N; l<r; l>>=1, r>>=1){
if(l&1)res+=tab[l++];
if(r&1)res+=tab[--r];
}
return res;
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, q;
cin>>n>>q;
string s;
cin>>s;
for(int i=0; i<n; i++){
siz[N+i]=1;
L[N+i]=i;
R[N+i]=i+1;
suf[N+i]=pref[N+i]=(s[i]-'0');
}
for(int i=N-1; i; i--){
siz[i]=siz[i+i]+siz[i+i+1];
L[i]=L[i+i];
M[i]=R[i+i];
if(R[i+i+1]==0)R[i]=R[i+i];
else R[i]=R[i+i+1];
upd(i);
}
for(int qq=1; qq<=q; qq++){
cin>>s;
if(s[0]=='q'){
//deb(qq);
typ[qq]=1;
int a, b;
cin>>a>>b;
a--;
b--;
if(a==b-1){
//deb(a, suf[N+a], tim[N+a]);
ans[qq]=male[a]+suf[N+a]*(qq-tim[N+a]);
continue;
}
//[a, b)
int v=1;
while(v<N){
int m=M[v];
if(m>=b)v=v+v;
else if(m<=a)v=v+v+1;
else{
int x=m-a, y=b-m;
//deb(v, L[v], R[v], suf[v+v], pref[v+v+1], qq-tim[v]);deb(x, y);
if(suf[v+v]>=x && pref[v+v+1]>=y){
ans[qq]+=qq-tim[v];
}
Q[v].eb(qq, mp(x, y));
break;
}
}
}
else{
int v;
cin>>v;
v--;
if(suf[N+v]){
male[v]+=qq-tim[N+v];
}
v+=N;
tim[v]=qq;
for(int vv=v/2; vv; vv/=2){
U[vv].eb(mp(qq, qq-tim[vv]), mp(suf[vv+vv], pref[vv+vv+1]));
}
suf[v]^=1;
pref[v]^=1;
for(v/=2; v; v/=2){
//deb(v, L[v], R[v], suf[v+v], pref[v+v+1], qq-tim[v]);
tim[v]=qq;
upd(v);
}
}
}
for(int v=1; v<N; v++){
if(Q[v].size() && U[v].size()>20){
vector<pair<pii, pii> > UU=U[v];
for(auto &i:UU){
swap(i.st, i.nd);
}
sort(all(UU));
reverse(all(UU));
sort(all(Q[v]), [](pair<int,pii> a, pair<int, pii> b)
{return a.nd>b.nd;});
for(auto i:UU){
//deb(i.st.st, i.st.nd, i.nd.st,i.nd.nd);
}
for(auto i:Q[v]){
//deb(i.st, i.nd.st,i.nd.nd);
}
int wsk=0;
for(auto i:Q[v]){
while(wsk<UU.size() && UU[wsk].st.st>=i.nd.st){
add(UU[wsk].st.nd, UU[wsk].nd.nd);
wsk++;
}
ans[i.st]+=sum(i.nd.nd, N);
}
wsk=0;
for(auto i:Q[v]){
while(wsk<UU.size() && UU[wsk].st.st>=i.nd.st){
add(UU[wsk].st.nd, -UU[wsk].nd.nd);
wsk++;
}
}
}
else{
for(auto j:U[v]){
for(auto i:Q[v]){
if(j.st.st<=i.st && j.nd.st>=i.nd.st && j.nd.nd>=i.nd.nd){
ans[i.st]+=j.st.nd;
}
}
}
}
}
for(int i=1; i<=q; i++){
if(typ[i])cout<<ans[i]<<"\n";
}
}
Compilation message
street_lamps.cpp: In function 'int main()':
street_lamps.cpp:138:13: warning: variable 'i' set but not used [-Wunused-but-set-variable]
138 | for(auto i:UU){
| ^
street_lamps.cpp:141:13: warning: variable 'i' set but not used [-Wunused-but-set-variable]
141 | for(auto i:Q[v]){
| ^
street_lamps.cpp:146:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
146 | while(wsk<UU.size() && UU[wsk].st.st>=i.nd.st){
| ~~~^~~~~~~~~~
street_lamps.cpp:154:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
154 | while(wsk<UU.size() && UU[wsk].st.st>=i.nd.st){
| ~~~^~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
27 ms |
49684 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
264 ms |
100856 KB |
Output is correct |
| 2 |
Correct |
210 ms |
100048 KB |
Output is correct |
| 3 |
Correct |
162 ms |
102180 KB |
Output is correct |
| 4 |
Correct |
344 ms |
123560 KB |
Output is correct |
| 5 |
Correct |
292 ms |
106880 KB |
Output is correct |
| 6 |
Correct |
364 ms |
135880 KB |
Output is correct |
| 7 |
Correct |
99 ms |
58868 KB |
Output is correct |
| 8 |
Correct |
98 ms |
60240 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
29 ms |
50124 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
28 ms |
49656 KB |
Output is correct |
| 2 |
Correct |
28 ms |
49940 KB |
Output is correct |
| 3 |
Correct |
30 ms |
50036 KB |
Output is correct |
| 4 |
Correct |
29 ms |
50120 KB |
Output is correct |
| 5 |
Correct |
166 ms |
67716 KB |
Output is correct |
| 6 |
Correct |
308 ms |
104788 KB |
Output is correct |
| 7 |
Correct |
490 ms |
140084 KB |
Output is correct |
| 8 |
Correct |
660 ms |
175856 KB |
Output is correct |
| 9 |
Correct |
483 ms |
133200 KB |
Output is correct |
| 10 |
Correct |
685 ms |
149036 KB |
Output is correct |
| 11 |
Correct |
480 ms |
133364 KB |
Output is correct |
| 12 |
Correct |
686 ms |
149152 KB |
Output is correct |
| 13 |
Correct |
483 ms |
133260 KB |
Output is correct |
| 14 |
Correct |
680 ms |
149060 KB |
Output is correct |
| 15 |
Correct |
106 ms |
61636 KB |
Output is correct |
| 16 |
Correct |
104 ms |
64088 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
27 ms |
49684 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
