結果

問題 No.649 ここでちょっとQK！
ユーザー AEnAEn
提出日時 2023-06-01 01:32:32
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 477 ms / 3,000 ms
コード長 4,539 bytes
コンパイル時間 395 ms
コンパイル使用メモリ 82,176 KB
実行使用メモリ 106,996 KB
最終ジャッジ日時 2024-12-28 14:24:01
合計ジャッジ時間 11,118 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 81 ms
67,328 KB
testcase_01 AC 78 ms
67,456 KB
testcase_02 AC 76 ms
67,200 KB
testcase_03 AC 156 ms
78,848 KB
testcase_04 AC 477 ms
106,996 KB
testcase_05 AC 361 ms
104,540 KB
testcase_06 AC 335 ms
104,680 KB
testcase_07 AC 81 ms
67,200 KB
testcase_08 AC 81 ms
67,456 KB
testcase_09 AC 78 ms
67,200 KB
testcase_10 AC 84 ms
67,200 KB
testcase_11 AC 83 ms
67,200 KB
testcase_12 AC 271 ms
82,860 KB
testcase_13 AC 260 ms
83,520 KB
testcase_14 AC 272 ms
83,440 KB
testcase_15 AC 321 ms
84,564 KB
testcase_16 AC 311 ms
83,708 KB
testcase_17 AC 329 ms
84,840 KB
testcase_18 AC 332 ms
85,432 KB
testcase_19 AC 352 ms
86,264 KB
testcase_20 AC 374 ms
86,984 KB
testcase_21 AC 392 ms
88,304 KB
testcase_22 AC 389 ms
88,148 KB
testcase_23 AC 402 ms
89,528 KB
testcase_24 AC 427 ms
90,056 KB
testcase_25 AC 446 ms
90,304 KB
testcase_26 AC 461 ms
91,216 KB
testcase_27 AC 103 ms
74,112 KB
testcase_28 AC 100 ms
73,856 KB
testcase_29 AC 101 ms
73,600 KB
testcase_30 AC 276 ms
83,556 KB
testcase_31 AC 313 ms
84,456 KB
testcase_32 AC 79 ms
67,200 KB
testcase_33 AC 82 ms
67,456 KB
testcase_34 AC 81 ms
67,072 KB
testcase_35 AC 82 ms
67,072 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

# https://github.com/tatyam-prime/SortedSet/blob/main/SortedMultiset.py
import math
from bisect import bisect_left, bisect_right, insort
from typing import Generic, Iterable, Iterator, TypeVar, Union, List
T = TypeVar('T')

class SortedMultiset(Generic[T]):
    BUCKET_RATIO = 50
    REBUILD_RATIO = 170

    def _build(self, a=None) -> None:
        "Evenly divide `a` into buckets."
        if a is None: a = list(self)
        size = self.size = len(a)
        bucket_size = int(math.ceil(math.sqrt(size / self.BUCKET_RATIO)))
        self.a = [a[size * i // bucket_size : size * (i + 1) // bucket_size] for i in range(bucket_size)]
    
    def __init__(self, a: Iterable[T] = []) -> None:
        "Make a new SortedMultiset from iterable. / O(N) if sorted / O(N log N)"
        a = list(a)
        if not all(a[i] <= a[i + 1] for i in range(len(a) - 1)):
            a = sorted(a)
        self._build(a)

    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 __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 _find_bucket(self, x: T) -> List[T]:
        "Find the bucket which should contain x. self must not be empty."
        for a in self.a:
            if x <= a[-1]: return a
        return a

    def __contains__(self, x: T) -> bool:
        if self.size == 0: return False
        a = self._find_bucket(x)
        i = bisect_left(a, x)
        return i != len(a) and a[i] == x

    def 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 = 1
            return
        a = self._find_bucket(x)
        insort(a, x)
        self.size += 1
        if len(a) > len(self.a) * self.REBUILD_RATIO:
            self._build()

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

    def lt(self, x: T) -> Union[T, None]:
        "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) -> Union[T, None]:
        "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) -> Union[T, None]:
        "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) -> Union[T, None]:
        "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, x: int) -> T:
        "Return the x-th element, or IndexError if it doesn't exist."
        if x < 0: x += self.size
        if x < 0: raise IndexError
        for a in self.a:
            if x < len(a): return a[x]
            x -= len(a)
        raise IndexError

    def index(self, x: T) -> 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:
        "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

import sys
input = sys.stdin.readline
Q,K = map(int, input().split())
sm = SortedMultiset()
for i in range(Q):
    q = list(map(int, input().split()))
    if q[0]==1:
        sm.add(q[1])
    else:
        if len(sm)<K:
            print(-1)
        else:
            ans = sm[K-1]
            print(ans)
            sm.discard(ans)
0