結果
問題 | No.2762 Counting and Deleting |
ユーザー | PNJ |
提出日時 | 2024-05-19 02:28:29 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 3,269 ms / 4,000 ms |
コード長 | 8,308 bytes |
コンパイル時間 | 808 ms |
コンパイル使用メモリ | 82,376 KB |
実行使用メモリ | 188,940 KB |
最終ジャッジ日時 | 2024-12-20 16:36:10 |
合計ジャッジ時間 | 31,618 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 72 ms
69,692 KB |
testcase_01 | AC | 79 ms
72,680 KB |
testcase_02 | AC | 78 ms
73,200 KB |
testcase_03 | AC | 75 ms
71,184 KB |
testcase_04 | AC | 77 ms
72,548 KB |
testcase_05 | AC | 71 ms
68,940 KB |
testcase_06 | AC | 73 ms
69,352 KB |
testcase_07 | AC | 2,940 ms
135,140 KB |
testcase_08 | AC | 2,826 ms
133,600 KB |
testcase_09 | AC | 2,752 ms
133,492 KB |
testcase_10 | AC | 3,047 ms
137,692 KB |
testcase_11 | AC | 3,169 ms
186,928 KB |
testcase_12 | AC | 3,269 ms
188,940 KB |
testcase_13 | AC | 3,252 ms
188,236 KB |
testcase_14 | AC | 3,203 ms
187,184 KB |
testcase_15 | AC | 2,235 ms
107,480 KB |
testcase_16 | AC | 2,329 ms
108,412 KB |
ソースコード
import mathfrom bisect import bisect_left, bisect_rightfrom typing import Generic, Iterable, Iterator, List, Tuple, TypeVar, OptionalT = TypeVar('T')class SortedMultiset(Generic[T]):BUCKET_RATIO = 16SPLIT_RATIO = 24def __init__(self, a: Iterable[T] = []) -> None:"Make a new SortedMultiset from iterable. / O(N) if sorted / O(N log N)"a = list(a)n = self.size = len(a)if any(a[i] > a[i + 1] for i in range(n - 1)):a.sort()bucket_size = int(math.ceil(math.sqrt(n / self.BUCKET_RATIO)))self.a = [a[n * i // bucket_size : n * (i + 1) // bucket_size] for i in range(bucket_size)]def __iter__(self) -> Iterator[T]:for i in self.a:for j in i: yield jdef __reversed__(self) -> Iterator[T]:for i in reversed(self.a):for j in reversed(i): yield jdef __eq__(self, other) -> bool:return list(self) == list(other)def __len__(self) -> int:return self.sizedef __repr__(self) -> str:return "SortedMultiset" + str(self.a)def __str__(self) -> str:s = str(list(self))return "{" + s[1 : len(s) - 1] + "}"def _position(self, x: T) -> Tuple[List[T], int, int]:"return the bucket, index of the bucket and position in which x should be. self must not be empty."for i, a in enumerate(self.a):if x <= a[-1]: breakreturn (a, i, bisect_left(a, x))def __contains__(self, x: T) -> bool:if self.size == 0: return Falsea, _, i = self._position(x)return i != len(a) and a[i] == xdef count(self, x: T) -> int:"Count the number of x."return self.index_right(x) - self.index(x)def add(self, x: T) -> None:"Add an element. / O(√N)"if self.size == 0:self.a = [[x]]self.size = 1returna, b, i = self._position(x)a.insert(i, x)self.size += 1if len(a) > len(self.a) * self.SPLIT_RATIO:mid = len(a) >> 1self.a[b:b+1] = [a[:mid], a[mid:]]def _pop(self, a: List[T], b: int, i: int) -> T:ans = a.pop(i)self.size -= 1if not a: del self.a[b]return ansdef discard(self, x: T) -> bool:"Remove an element and return True if removed. / O(√N)"if self.size == 0: return Falsea, b, i = self._position(x)if i == len(a) or a[i] != x: return Falseself._pop(a, b, i)return Truedef lt(self, x: T) -> Optional[T]:"Find the largest element < x, or None if it doesn't exist."for a in reversed(self.a):if a[0] < x:return a[bisect_left(a, x) - 1]def le(self, x: T) -> Optional[T]:"Find the largest element <= x, or None if it doesn't exist."for a in reversed(self.a):if a[0] <= x:return a[bisect_right(a, x) - 1]def gt(self, x: T) -> Optional[T]:"Find the smallest element > x, or None if it doesn't exist."for a in self.a:if a[-1] > x:return a[bisect_right(a, x)]def ge(self, x: T) -> Optional[T]:"Find the smallest element >= x, or None if it doesn't exist."for a in self.a:if a[-1] >= x:return a[bisect_left(a, x)]def __getitem__(self, i: int) -> T:"Return the i-th element."if i < 0:for a in reversed(self.a):i += len(a)if i >= 0: return a[i]else:for a in self.a:if i < len(a): return a[i]i -= len(a)raise IndexErrordef pop(self, i: int = -1) -> T:"Pop and return the i-th element."if i < 0:for b, a in enumerate(reversed(self.a)):i += len(a)if i >= 0: return self._pop(a, ~b, i)else:for b, a in enumerate(self.a):if i < len(a): return self._pop(a, b, i)i -= len(a)raise IndexErrordef bisect(self, x: T) -> int:"Count the number of elements < x."ans = 0for a in self.a:if a[-1] >= x:return ans + bisect_left(a, x)ans += len(a)return ansdef index_right(self, x: T) -> int:"Count the number of elements <= x."ans = 0for a in self.a:if a[-1] > x:return ans + bisect_right(a, x)ans += len(a)return ansdef mul(A,B):l,m,n = len(A),len(B),len(B[0])C = [[0] * n for i in range(l)]for i in range(l):for j in range(m):a = A[i][j]for k in range(n):C[i][k] = (C[i][k] + a * B[j][k]) % modreturn Cdef Mul(A,B):C = [[0 for i in range(3)] for j in range(3)]for i in range(3):for j in range(3):for k in range(3):C[i][k] += B[i][j] * A[j][k]C[i][k] %= modreturn Cclass segtree():n=1size=1log=2d=[0]op=Nonee=10**15def __init__(self,V,OP,E):self.n=len(V)self.op=OPself.e=Eself.log=(self.n-1).bit_length()self.size=1<<self.logself.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.np+=self.sizeself.d[p]=xfor i in range(1,self.log+1):self.update(p>>i)def get(self,p):assert 0<=p and p<self.nreturn self.d[p+self.size]def prod(self,l,r):assert 0<=l and l<=r and r<=self.nsml=self.esmr=self.el+=self.sizer+=self.sizewhile(l<r):if (l&1):sml=self.op(sml,self.d[l])l+=1if (r&1):smr=self.op(self.d[r-1],smr)r-=1l>>=1r>>=1return self.op(sml,smr)def all_prod(self):return self.d[1]def max_right(self,l,f):assert 0<=l and l<=self.nassert f(self.e)if l==self.n:return self.nl+=self.sizesm=self.ewhile(1):while(l%2==0):l>>=1if not(f(self.op(sm,self.d[l]))):while(l<self.size):l=2*lif f(self.op(sm,self.d[l])):sm=self.op(sm,self.d[l])l+=1return l-self.sizesm=self.op(sm,self.d[l])l+=1if (l&-l)==l:breakreturn self.ndef min_left(self,r,f):assert 0<=r and r<=self.nassert f(self.e)if r==0:return 0r+=self.sizesm=self.ewhile(1):r-=1while(r>1 and (r%2)):r>>=1if 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-=1return r+1-self.sizesm=self.op(self.d[r],sm)if (r& -r)==r:breakreturn 0def 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)])mod = 998244353A = [[1,1,0],[0,1,0],[0,0,1]]B = [[1,0,0],[1,1,1],[0,0,1]]E = [[1,0,0],[0,1,0],[0,0,1]]N,Q = map(int,input().split())S = input()T = []P = SortedMultiset([i for i in range(N)])for i in range(N):if S[i] == '0':T.append(A)else:T.append(B)seg = segtree(T,Mul,E)for _ in range(Q):q,l,r = map(int,input().split())l -= 1if q == 1:X = []while P.ge(l) is not None:p = P.ge(l)if p >= r:breakX.append(p)P.discard(p)for x in X:seg.set(x,E)else:D = seg.prod(l,r)dp = mul(D,[[0],[0],[1]])print((dp[0][0] + dp[1][0]) % mod)