結果
問題 | No.2281 K → K-1 01 Flip |
ユーザー |
![]() |
提出日時 | 2023-04-21 11:43:14 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 873 ms / 2,000 ms |
コード長 | 3,479 bytes |
コンパイル時間 | 267 ms |
コンパイル使用メモリ | 82,848 KB |
実行使用メモリ | 99,752 KB |
最終ジャッジ日時 | 2024-11-06 07:58:06 |
合計ジャッジ時間 | 36,769 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 56 |
ソースコード
# https://github.com/shakayami/ACL-for-python/blob/master/segtree.py class segtree(): n=1 size=1 log=2 d=[0] op=None e=10**15 def __init__(self,V,OP,E): self.n=len(V) self.op=OP self.e=E self.log=(self.n-1).bit_length() self.size=1<<self.log self.d=[E for i in range(2*self.size)] for i in range(self.n): self.d[self.size+i]=V[i] for i in range(self.size-1,0,-1): self.update(i) def set(self,p,x): assert 0<=p and p<self.n p+=self.size self.d[p]=x for i in range(1,self.log+1): self.update(p>>i) def get(self,p): assert 0<=p and p<self.n return self.d[p+self.size] def prod(self,l,r): assert 0<=l and l<=r and r<=self.n sml=self.e smr=self.e l+=self.size r+=self.size while(l<r): if (l&1): sml=self.op(sml,self.d[l]) l+=1 if (r&1): smr=self.op(self.d[r-1],smr) r-=1 l>>=1 r>>=1 return self.op(sml,smr) def all_prod(self): return self.d[1] def max_right(self,l,f): assert 0<=l and l<=self.n assert f(self.e) if l==self.n: return self.n l+=self.size sm=self.e while(1): while(l%2==0): l>>=1 if not(f(self.op(sm,self.d[l]))): while(l<self.size): l=2*l if f(self.op(sm,self.d[l])): sm=self.op(sm,self.d[l]) l+=1 return l-self.size sm=self.op(sm,self.d[l]) l+=1 if (l&-l)==l: break return self.n def min_left(self,r,f): assert 0<=r and r<=self.n assert f(self.e) if r==0: return 0 r+=self.size sm=self.e while(1): r-=1 while(r>1 and (r%2)): r>>=1 if not(f(self.op(self.d[r],sm))): while(r<self.size): r=(2*r+1) if f(self.op(self.d[r],sm)): sm=self.op(self.d[r],sm) r-=1 return r+1-self.size sm=self.op(self.d[r],sm) if (r& -r)==r: break return 0 def update(self,k): self.d[k]=self.op(self.d[2*k],self.d[2*k+1]) def __str__(self): return str([self.get(i) for i in range(self.n)]) n, q = map(int, input().split()) s = input() cum = [0] * (n + 1) for i in range(n): cum[i + 1] = cum[i] + (1 if s[i] == '0' else -1) left, right, length = list(), list(), list() where = [0] * n for i in range(n): if i != 0 and s[i - 1] == s[i]: right[-1] += 1 length[-1] += 1 else: left.append(i) right.append(i) length.append(1) where[i] = len(left) - 1 seg = segtree(length, max, -10**9) for _ in range(q): l, r, k = map(int, input().split()) l -= 1 r -= 1 li, ri = where[l], where[r] ok = False if right[li] - l + 1 >= k: ok = True elif r - left[ri] + 1 >= k: ok = True else: li += 1 ri -= 1 if li <= ri and seg.prod(li, ri + 1) >= k: ok = True if (not ok): print(r - l + 1) continue x = (cum[r + 1] - cum[l]) % (2*k - 1) print(max(x - 1, 2*k - 2 - x))