結果

問題 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
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 114 ms
88,320 KB
testcase_01 AC 118 ms
88,576 KB
testcase_02 AC 114 ms
88,448 KB
testcase_03 AC 115 ms
88,832 KB
testcase_04 AC 113 ms
88,448 KB
testcase_05 AC 114 ms
88,448 KB
testcase_06 AC 113 ms
88,448 KB
testcase_07 AC 119 ms
88,320 KB
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 AC 3,775 ms
269,868 KB
testcase_22 AC 3,947 ms
269,868 KB
testcase_23 AC 919 ms
150,084 KB
testcase_24 AC 117 ms
88,704 KB
testcase_25 AC 118 ms
88,576 KB
testcase_26 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

import typing

def _ceil_pow2(n: int) -> int:
    x = 0
    while (1 << x) < n:
        x += 1

    return x


def _bsf(n: int) -> int:
    x = 0
    while n % 2 == 0:
        x += 1
        n //= 2

    return x



class 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 = op
        self._e = e

        if isinstance(v, int):
            v = [e] * v

        self._n = len(v)
        self._log = _ceil_pow2(self._n)
        self._size = 1 << self._log
        self._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._n

        p += self._size
        self._d[p] = x
        for i in range(1, self._log + 1):
            self._update(p >> i)

    def get(self, p: int) -> typing.Any:
        assert 0 <= p < self._n

        return self._d[p + self._size]

    def prod(self, left: int, right: int) -> typing.Any:
        assert 0 <= left <= right <= self._n
        sml = self._e
        smr = self._e
        left += self._size
        right += self._size

        while left < right:
            if left & 1:
                sml = self._op(sml, self._d[left])
                left += 1
            if right & 1:
                right -= 1
                smr = self._op(self._d[right], smr)
            left >>= 1
            right >>= 1

        return 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._n
        assert f(self._e)

        if left == self._n:
            return self._n

        left += self._size
        sm = self._e

        first = True
        while first or (left & -left) != left:
            first = False
            while left % 2 == 0:
                left >>= 1
            if not f(self._op(sm, self._d[left])):
                while left < self._size:
                    left *= 2
                    if f(self._op(sm, self._d[left])):
                        sm = self._op(sm, self._d[left])
                        left += 1
                return left - self._size
            sm = self._op(sm, self._d[left])
            left += 1

        return self._n

    def min_left(self, right: int,
                 f: typing.Callable[[typing.Any], bool]) -> int:
        assert 0 <= right <= self._n
        assert f(self._e)

        if right == 0:
            return 0

        right += self._size
        sm = self._e

        first = True
        while first or (right & -right) != right:
            first = False
            right -= 1
            while right > 1 and right % 2:
                right >>= 1
            if not f(self._op(self._d[right], sm)):
                while right < self._size:
                    right = 2 * right + 1
                    if f(self._op(self._d[right], sm)):
                        sm = self._op(self._d[right], sm)
                        right -= 1
                return right + 1 - self._size
            sm = self._op(self._d[right], sm)

        return 0

    def _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] = L0

def 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 = q
        buf.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] = m
        p, 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!')
0