1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316
| #include <bits/stdc++.h> #define MAXN 205 #define MAX 300005 using namespace std; inline int read(){ int x=0,f=1; char ch=getchar(); while (ch<'0'||ch>'9'){ if (ch=='-') f=-1; ch=getchar(); } while (ch>='0'&&ch<='9'){ x=(x<<3)+(x<<1)+(ch^'0'); ch=getchar(); } return x*f; } void write(register int x){ if (x>=10) write(x/10); putchar(x%10+'0'); } inline void Print(int x){ if (x==0) puts("0"); else write(x),putchar('\n'); }
int cmd[MAX],ql[MAX],qr[MAX],qval[MAX],vis[MAX]; char opr[10],s[MAX]; bool flag2,flag3; inline void ReadQuerys(int q){ flag2=flag3=true; for (register int i=1;i<=q;++i){ scanf("%s",opr); if (opr[0]=='q'){ cmd[i]=0; int l=read(),r=read(); if (r!=l+1) flag2=false; ql[i]=l,qr[i]=r; } else { cmd[i]=1; int pos=read(); if (vis[pos]==1) flag3=false; vis[pos]=1; qval[i]=pos; } } } namespace SegmentTree{ struct node{ int l,r; int maxn; }tree[1000005*4]; #define lc i<<1 #define rc i<<1|1 inline void pushup(int i){ tree[i].maxn=max(tree[lc].maxn,tree[rc].maxn); } void Build(int i,int l,int r){ tree[i].l=l,tree[i].r=r; if (l==r){ tree[i].maxn=0x7fffffff; return ; } int mid=(l+r)>>1; Build(lc,l,mid); Build(rc,mid+1,r); pushup(i); } void Update(int i,int pos,int val){ if (tree[i].l==tree[i].r){ tree[i].maxn=val; return ; } int mid=(tree[i].l+tree[i].r)>>1; if (pos<=mid) Update(lc,pos,val); else Update(rc,pos,val); pushup(i); } int Query(int i,int L,int R){ if (L<=tree[i].l&&tree[i].r<=R){ return tree[i].maxn; } int mid=(tree[i].l+tree[i].r)>>1,ans=-0x7fffffff; if (L<=mid) ans=max(ans,Query(lc,L,R)); if (mid<R) ans=max(ans,Query(rc,L,R)); return ans; } } using namespace SegmentTree; namespace Special_3{ inline int Solve(int n,int q){ Build(1,1,n); for (register int i=1;i<=n;++i){ if ((s[i]-'0')==1) Update(1,i,0); } for (register int t=1;t<=q;++t) { if (cmd[t]==0){ int l=ql[t],r=qr[t]; int ans=Query(1,l,r-1); if (ans==0x7fffffff) puts("0"); else Print(t-ans); } else { int i=qval[t]; Update(1,i,t); } } return 0; } } namespace Special_2{ int lst[MAX]; int ans[MAX],a[MAX]; inline int Solve(int n,int q){ for (register int i=1;i<=n;++i) a[i]=s[i]-'0'; for (register int i=1;i<=n;++i) { if (a[i]==1) lst[i]=0; else lst[i]=-1; } for (register int t=1;t<=q;++t){ if (cmd[t]==0){ int l=ql[t],r=qr[t]; Print(ans[l]+(t-lst[l])*a[l]); } else { int pos=qval[t]; a[pos]=!a[pos]; if (a[pos]==0){ ans[pos]+=t-lst[pos]; } lst[pos]=t; } } return 0; } } namespace BruteForce{ int a[MAXN][MAXN]; inline void Copy(int i,int j,int n){ for (register int k=1;k<=n;++k){ a[j][k]=a[i][k]; } } inline int Solve(int n,int q){ for (register int i=1;i<=n;++i) a[0][i]=s[i]-'0'; for (register int i=1;i<=q;++i){ Copy(i-1,i,n); if (cmd[i]==0){ int l=ql[i],r=qr[i]; int ans=0; for (register int j=0;j<i;++j){ bool flag=false; for (register int k=l;k<r;++k){ if (a[j][k]==0) { flag=true;break; } } if (flag==false){ ans++; } } Print(ans); } else { int pos=qval[i]; a[i][pos]=!a[i][pos]; } } return 0; } } namespace Correct{ int Max; namespace BIT{ int C[MAX]; #define lowbit(x) (x&(-x)) inline int Query(int k){ int ans=0; for (register int i=k;i>=1;i-=lowbit(i)){ ans+=C[i]; } return ans; } inline void Update(int k,int val){ for (register int i=k;i<=Max;i+=lowbit(i)){ C[i]+=val; } } } using namespace BIT; struct node{ int t,x,y,id; int type,val,ans; }; node F[MAX*4]; int tot; inline void Add(int tim,int type,int x,int y,int val,int id){ F[++tot].t=tim; F[tot].x=x; F[tot].y=y; F[tot].type=type; F[tot].val=val; F[tot].id=id; F[tot].ans=0; } inline bool cmp1(const node &A,const node &B){ if (A.t!=B.t) return A.t<B.t; if (A.x!=B.x) return A.x<B.x; return A.y<B.y; } inline bool cmp2(const node &A,const node &B){ if (A.x!=B.x) return A.x<B.x; return A.y<B.y; } inline bool cmp3(const node &A,const node &B){ return A.y<B.y; } node tempF[MAX*4]; inline void Msort(int l,int r){ int mid=(l+r)/2; int j=l,k=mid+1; for (register int i=l;i<=r;++i){ if ((k>r)||(j<=mid&&cmp2(F[j],F[k]))) tempF[i]=F[j++]; else tempF[i]=F[k++]; } for (register int i=l;i<=r;++i){ F[i]=tempF[i]; } } void CDQ(int l,int r){ if (l==r) return ; int mid=(l+r)>>1; CDQ(l,mid),CDQ(mid+1,r); int p=l-1; for (register int i=mid+1;i<=r;++i){ while (p<mid&&F[p+1].x<=F[i].x){++p;if (F[p].type==2) Update(F[p].y,F[p].val);} if (F[i].type==1) F[i].ans+=Query(F[i].y); } for (register int i=l;i<=p;++i){ if (F[i].type==2) Update(F[i].y,-F[i].val); } Msort(l,r); } inline void AddRec(int tim,int x1,int y1,int x2,int y2,int val){ Add(tim,2,x1-1,y1-1,val,0); Add(tim,2,x1-1,y2,-val,0); Add(tim,2,x2,y1-1,-val,0); Add(tim,2,x2,y2,val,0); } set<int>S; #define Iter set<int>::iterator inline int GetPre(const int &A){ Iter it=S.lower_bound(A); return *--it; } inline int GetNex(const int &A){ Iter it=S.upper_bound(A); return *it; } int Ans[MAX]; inline int Solve(int n,int q){ Max=q; for (register int i=1;i<=n;++i) if (s[i]=='0') S.insert(i); S.insert(0); S.insert(n+1); int cntq=0; for (register int i=1;i<=q;++i){ if (cmd[i]==0){ int l=ql[i],r=qr[i]; Add(i,1,l,r-1,0,++cntq); if (GetNex(l)>r-1&&s[l]=='1'&&s[r-1]=='1') Ans[cntq]+=i; } else { int pos=qval[i]; s[pos]=s[pos]=='1'?'0':'1'; if (s[pos]=='1'){ int l=GetPre(pos)+1,r=GetNex(pos)-1; S.erase(pos); AddRec(i,l+1,pos+1,pos+1,r+1,-i); } else { int l=GetPre(pos)+1,r=GetNex(pos)-1; S.insert(pos); AddRec(i,l+1,pos+1,pos+1,r+1,i); } } } sort(F+1,F+1+tot,cmp1); CDQ(1,tot); for (register int i=1;i<=tot;++i){ if (F[i].type==1){ Ans[F[i].id]+=F[i].ans; } } for (register int i=1;i<=cntq;++i){ Print(Ans[i]); } return 0; } } int main(){ int n=read(),q=read(); scanf("%s",s+1); ReadQuerys(q); if (n<=100&&q<=100) return BruteForce::Solve(n,q); if (flag2) return Special_2::Solve(n,q); if ((n!=500||q!=300000)&&flag3) return Special_3::Solve(n,q); return Correct::Solve(n,q); return 0; }
|