#991072 (PyPy3) No.649 ここでちょっとQK！

提出ソース

結果

問題	No.649 ここでちょっとQK！
ユーザー	titia
提出日時	2024-06-28 04:41:05
言語	PyPy3 (7.3.15)
結果	AC
実行時間	354 ms / 3,000 ms
コード長	5,061 bytes
コンパイル時間	148 ms
コンパイル使用メモリ	82,148 KB
実行使用メモリ	90,388 KB
最終ジャッジ日時	2024-06-28 04:41:16
合計ジャッジ時間	9,764 ms
ジャッジサーバーID （参考情報）	judge4 / judge5

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	62 ms 68,656 KB
testcase_01	AC	62 ms 67,784 KB
testcase_02	AC	62 ms 67,720 KB
testcase_03	AC	137 ms 79,284 KB
testcase_04	AC	284 ms 81,084 KB
testcase_05	AC	306 ms 81,072 KB
testcase_06	AC	280 ms 81,216 KB
testcase_07	AC	62 ms 68,732 KB
testcase_08	AC	63 ms 67,796 KB
testcase_09	AC	62 ms 68,884 KB
testcase_10	AC	63 ms 68,408 KB
testcase_11	AC	64 ms 68,956 KB
testcase_12	AC	250 ms 83,296 KB
testcase_13	AC	208 ms 83,144 KB
testcase_14	AC	209 ms 83,272 KB
testcase_15	AC	219 ms 83,808 KB
testcase_16	AC	214 ms 83,752 KB
testcase_17	AC	259 ms 83,524 KB
testcase_18	AC	240 ms 84,696 KB
testcase_19	AC	249 ms 85,392 KB
testcase_20	AC	272 ms 85,808 KB
testcase_21	AC	284 ms 86,864 KB
testcase_22	AC	306 ms 86,920 KB
testcase_23	AC	303 ms 87,968 KB
testcase_24	AC	317 ms 88,656 KB
testcase_25	AC	354 ms 89,256 KB
testcase_26	AC	341 ms 90,388 KB
testcase_27	AC	80 ms 74,520 KB
testcase_28	AC	86 ms 77,696 KB
testcase_29	AC	86 ms 77,920 KB
testcase_30	AC	219 ms 83,412 KB
testcase_31	AC	209 ms 83,128 KB
testcase_32	AC	68 ms 68,652 KB
testcase_33	AC	62 ms 68,008 KB
testcase_34	AC	64 ms 68,588 KB
testcase_35	AC	63 ms 67,800 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

import sys
input = sys.stdin.readline

# 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, List, Tuple, TypeVar, Optional
T = TypeVar('T')

class SortedMultiset(Generic[T]):
    BUCKET_RATIO = 16
    SPLIT_RATIO = 24
    
    def __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()
        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]:
        "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:
        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:
        "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, 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:
        ans = a.pop(i)
        self.size -= 1
        if not a: del self.a[b]
        return ans

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

Q,K=map(int,input().split())

S=SortedMultiset()

for tests in range(Q):
    L=list(map(int,input().split()))

    if L[0]==2:
        if len(S)<K:
            print(-1)
        else:
            print(S[K-1])
            S.discard(S[K-1])
    else:
        S.add(L[1])

yukicoder

結果

テストケース

ソースコード