結果
問題 | No.649 ここでちょっとQK! |
ユーザー | AEn |
提出日時 | 2023-06-01 01:32:32 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 525 ms / 3,000 ms |
コード長 | 4,539 bytes |
コンパイル時間 | 262 ms |
コンパイル使用メモリ | 87,032 KB |
実行使用メモリ | 111,056 KB |
最終ジャッジ日時 | 2023-08-28 01:47:40 |
合計ジャッジ時間 | 13,553 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 164 ms
80,588 KB |
testcase_01 | AC | 164 ms
80,316 KB |
testcase_02 | AC | 165 ms
80,596 KB |
testcase_03 | AC | 240 ms
83,728 KB |
testcase_04 | AC | 525 ms
111,056 KB |
testcase_05 | AC | 427 ms
107,188 KB |
testcase_06 | AC | 389 ms
105,828 KB |
testcase_07 | AC | 166 ms
80,560 KB |
testcase_08 | AC | 167 ms
80,508 KB |
testcase_09 | AC | 164 ms
80,692 KB |
testcase_10 | AC | 163 ms
80,584 KB |
testcase_11 | AC | 165 ms
80,596 KB |
testcase_12 | AC | 332 ms
87,924 KB |
testcase_13 | AC | 320 ms
87,752 KB |
testcase_14 | AC | 327 ms
87,368 KB |
testcase_15 | AC | 381 ms
88,864 KB |
testcase_16 | AC | 364 ms
89,788 KB |
testcase_17 | AC | 389 ms
89,164 KB |
testcase_18 | AC | 394 ms
89,380 KB |
testcase_19 | AC | 412 ms
90,100 KB |
testcase_20 | AC | 425 ms
92,392 KB |
testcase_21 | AC | 438 ms
92,348 KB |
testcase_22 | AC | 449 ms
93,364 KB |
testcase_23 | AC | 452 ms
94,124 KB |
testcase_24 | AC | 474 ms
95,568 KB |
testcase_25 | AC | 484 ms
95,276 KB |
testcase_26 | AC | 498 ms
95,768 KB |
testcase_27 | AC | 182 ms
82,364 KB |
testcase_28 | AC | 178 ms
82,296 KB |
testcase_29 | AC | 181 ms
82,432 KB |
testcase_30 | AC | 340 ms
88,172 KB |
testcase_31 | AC | 366 ms
90,020 KB |
testcase_32 | AC | 163 ms
80,652 KB |
testcase_33 | AC | 168 ms
80,596 KB |
testcase_34 | AC | 168 ms
80,604 KB |
testcase_35 | AC | 167 ms
80,592 KB |
ソースコード
# 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)