結果
問題 | No.2942 Sigma Music Game Level Problem |
ユーザー |
![]() |
提出日時 | 2024-10-18 22:26:53 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,250 bytes |
コンパイル時間 | 563 ms |
コンパイル使用メモリ | 82,816 KB |
実行使用メモリ | 283,460 KB |
最終ジャッジ日時 | 2024-11-07 22:01:44 |
合計ジャッジ時間 | 34,240 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 10 WA * 14 |
ソースコード
import typingdef _ceil_pow2(n: int) -> int:x = 0while (1 << x) < n:x += 1return xdef _bsf(n: int) -> int:x = 0while n % 2 == 0:x += 1n //= 2return xclass SegTree:def __init__(self,op: typing.Callable[[typing.Any, typing.Any], typing.Any],e: typing.Any,v: typing.Union[int, typing.List[typing.Any]]) -> None:self._op = opself._e = eif isinstance(v, int):v = [e] * vself._n = len(v)self._log = _ceil_pow2(self._n)self._size = 1 << self._logself._d = [e] * (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: int, x: typing.Any) -> None:assert 0 <= p < self._np += self._sizeself._d[p] = xfor i in range(1, self._log + 1):self._update(p >> i)def get(self, p: int) -> typing.Any:assert 0 <= p < self._nreturn self._d[p + self._size]def prod(self, left: int, right: int) -> typing.Any:assert 0 <= left <= right <= self._nsml = self._esmr = self._eleft += self._sizeright += self._sizewhile left < right:if left & 1:sml = self._op(sml, self._d[left])left += 1if right & 1:right -= 1smr = self._op(self._d[right], smr)left >>= 1right >>= 1return self._op(sml, smr)def all_prod(self) -> typing.Any:return self._d[1]def max_right(self, left: int,f: typing.Callable[[typing.Any], bool]) -> int:assert 0 <= left <= self._nassert f(self._e)if left == self._n:return self._nleft += self._sizesm = self._efirst = Truewhile first or (left & -left) != left:first = Falsewhile left % 2 == 0:left >>= 1if not f(self._op(sm, self._d[left])):while left < self._size:left *= 2if f(self._op(sm, self._d[left])):sm = self._op(sm, self._d[left])left += 1return left - self._sizesm = self._op(sm, self._d[left])left += 1return self._ndef min_left(self, right: int,f: typing.Callable[[typing.Any], bool]) -> int:assert 0 <= right <= self._nassert f(self._e)if right == 0:return 0right += self._sizesm = self._efirst = Truewhile first or (right & -right) != right:first = Falseright -= 1while right > 1 and right % 2:right >>= 1if not f(self._op(self._d[right], sm)):while right < self._size:right = 2 * right + 1if f(self._op(self._d[right], sm)):sm = self._op(self._d[right], sm)right -= 1return right + 1 - self._sizesm = self._op(self._d[right], sm)return 0def _update(self, k: int) -> None:self._d[k] = self._op(self._d[2 * k], self._d[2 * k + 1])N, Q, L0 = map(int, input().split())A = list(map(int, input().split()))L = [0] * (Q+1)L[0] = L0def op(x, y):return (x[0] + y[0], x[1] + y[1])seg = SegTree(op, (0, 0), 200001)for a in A:p, q = seg.get(a)seg.set(a, (p+1, q+a))buf = []for i in range(Q):t, *q = map(int, input().split())if t == 1:l = q[0]p, q = seg.get(l)seg.set(l, (p+1, q+l))elif t == 2:l, r = qbuf.append(seg.prod(l, r+1))else:m = q[0]p, q = seg.get(L[i])seg.set(L[i], (p-1, q-L[i]))L[i] = mp, q = seg.get(L[i])seg.set(L[i], (p+1, q+L[i]))if buf:print("\n".join(f"{p} {q}" for p, q in buf))else:print('Not Found!')