結果

問題 No.3298 K-th Slime
ユーザー kmmtkm
提出日時 2025-10-05 14:05:20
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 274 ms / 2,000 ms
コード長 6,208 bytes
コンパイル時間 200 ms
コンパイル使用メモリ 82,240 KB
実行使用メモリ 93,076 KB
最終ジャッジ日時 2025-10-05 14:05:32
合計ジャッジ時間 5,277 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 25
権限があれば一括ダウンロードができます

ソースコード

diff # 

# 自作ライブラリ
# https://github.com/takumi-okamoto/competitive-programming-public/tree/main/mylib

import sys


# sys.setrecursionlimit(10**8)


def debug(*args):
    print(*args, file=sys.stderr)


# tatyam さんのコードを借りる
# https://github.com/tatyam-prime/SortedSet/blob/main/SortedMultiset.py
import math
from bisect import bisect_left, bisect_right

# from typing import Generic, Iterable, Iterator, TypeVar

# T = TypeVar("T")


# class SortedMultiset(Generic[T]):
class SortedMultiset:
    BUCKET_RATIO = 16
    SPLIT_RATIO = 24

    # def __init__(self, a: Iterable[T] = []) -> None:
    def __init__(self, a) -> 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()
        num_bucket = int(math.ceil(math.sqrt(n / self.BUCKET_RATIO)))
        self.a = [
            a[n * i // num_bucket : n * (i + 1) // num_bucket]
            for i in range(num_bucket)
        ]

    def __iter__(self):  # -> Iterator[T]:
        for i in self.a:
            for j in i:
                yield j

    def __reversed__(self):  # -> Iterator[T]:
        for i in reversed(self.a):
            for j in reversed(i):
                yield j

    def __eq__(self, other) -> bool:
        return list(self) == list(other)

    def __len__(self) -> int:
        return self.size

    def __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]:
    def _position(self, x):
        "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]:
                break
        return (a, i, bisect_left(a, x))

    # def __contains__(self, x: T) -> bool:
    def __contains__(self, x) -> bool:

        if self.size == 0:
            return False
        a, _, i = self._position(x)
        return i != len(a) and a[i] == x

    # def count(self, x: T) -> int:
    def count(self, x) -> int:
        "Count the number of x."
        return self.index_right(x) - self.index(x)

    # def add(self, x: T) -> None:
    def add(self, x) -> None:
        "Add an element. / O(√N)"
        if self.size == 0:
            self.a = [[x]]
            self.size = 1
            return
        a, b, i = self._position(x)
        a.insert(i, x)
        self.size += 1
        if len(a) > len(self.a) * self.SPLIT_RATIO:
            mid = len(a) >> 1
            self.a[b : b + 1] = [a[:mid], a[mid:]]

    # def _pop(self, a: list[T], b: int, i: int) -> T:
    def _pop(self, a: list, b: int, i: int):

        ans = a.pop(i)
        self.size -= 1
        if not a:
            del self.a[b]
        return ans

    # def discard(self, x: T) -> bool:
    def discard(self, x) -> bool:
        "Remove an element and return True if removed. / O(√N)"
        if self.size == 0:
            return False
        a, b, i = self._position(x)
        if i == len(a) or a[i] != x:
            return False
        self._pop(a, b, i)
        return True

    # def lt(self, x: T) -> T | None:
    def lt(self, x):
        "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) -> T | None:
    def le(self, x):
        "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) -> T | None:
    def gt(self, x):
        "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) -> T | None:
    def ge(self, x):
        "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:
    def __getitem__(self, i: int):
        "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 IndexError

    # def pop(self, i: int = -1) -> T:
    def pop(self, i: int = -1):
        "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 IndexError

    # def index(self, x: T) -> int:
    def index(self, x) -> int:
        "Count the number of elements < x."
        ans = 0
        for a in self.a:
            if a[-1] >= x:
                return ans + bisect_left(a, x)
            ans += len(a)
        return ans

    # def index_right(self, x: T) -> int:
    def index_right(self, x) -> int:
        "Count the number of elements <= x."
        ans = 0
        for a in self.a:
            if a[-1] > x:
                return ans + bisect_right(a, x)
            ans += len(a)
        return ans


def main():
    n, k, q = map(int, input().split())
    a = list(map(int, input().split()))

    ss = SortedMultiset(a)
    ans = []
    for _ in range(q):
        # debug(ss)
        query = list(map(int, input().split()))
        if query[0] == 1:
            x = query[1]
            ss.add(x)
        elif query[0] == 2:
            y = query[1]
            s = ss.pop(k - 1)
            ss.add(s + y)
        else:
            ans.append(ss[k - 1])
    # debug("d")
    print(*ans, sep="\n")


if __name__ == "__main__":
    main()
0