結果
問題 | No.2804 Fixer And Ratism |
ユーザー | N-noa21 |
提出日時 | 2024-09-30 13:58:09 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 5,776 bytes |
コンパイル時間 | 740 ms |
コンパイル使用メモリ | 13,312 KB |
実行使用メモリ | 12,288 KB |
最終ジャッジ日時 | 2024-09-30 13:58:26 |
合計ジャッジ時間 | 8,737 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 34 ms
11,904 KB |
testcase_01 | AC | 34 ms
11,904 KB |
testcase_02 | AC | 34 ms
11,904 KB |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | AC | 44 ms
11,904 KB |
testcase_10 | WA | - |
testcase_11 | AC | 245 ms
12,160 KB |
testcase_12 | WA | - |
testcase_13 | AC | 75 ms
12,032 KB |
testcase_14 | AC | 233 ms
11,904 KB |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | AC | 98 ms
11,904 KB |
testcase_18 | WA | - |
testcase_19 | AC | 41 ms
12,032 KB |
testcase_20 | WA | - |
testcase_21 | AC | 313 ms
12,032 KB |
testcase_22 | WA | - |
testcase_23 | AC | 327 ms
12,032 KB |
testcase_24 | WA | - |
testcase_25 | AC | 353 ms
11,904 KB |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | AC | 321 ms
11,904 KB |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | AC | 328 ms
12,032 KB |
testcase_33 | WA | - |
ソースコード
# 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 N,Q = map(int, input().split()) pc = N fixed = SortedMultiset([]) member = SortedMultiset([]) from collections import defaultdict d = defaultdict(int) for i in range(Q): query = input().split() if query[0] == "1": s,r = query[1],int(query[2]) member.add((r,s)) d[s] = r while len(fixed)+len(member) > pc: if len(member) > 0: r,s = member.pop(0) print(s) else: r,s = fixed.pop(0) print(s) elif query[0] == "2": pc -= int(query[1]) while len(fixed)+len(member) > pc: if len(member) > 0: r,s = member.pop(0) print(s) else: r,s = fixed.pop(0) print(s) elif query[0] == "3": s,x = query[1],int(query[2]) pc += x if (d[s],s) in member: member.discard((d[s],s)) fixed.add((d[s],s)) #print(member) #print(fixed) #print(" ")