結果
問題 | No.2809 Sort Query |
ユーザー | highlighter |
提出日時 | 2024-04-21 17:54:49 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 5,398 bytes |
コンパイル時間 | 534 ms |
コンパイル使用メモリ | 82,344 KB |
実行使用メモリ | 153,604 KB |
最終ジャッジ日時 | 2024-07-12 20:53:59 |
合計ジャッジ時間 | 81,432 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 63 ms
68,052 KB |
testcase_01 | AC | 1,097 ms
142,576 KB |
testcase_02 | AC | 1,093 ms
142,812 KB |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | AC | 1,079 ms
136,376 KB |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | AC | 1,079 ms
136,728 KB |
testcase_10 | AC | 1,081 ms
136,876 KB |
testcase_11 | AC | 1,062 ms
150,072 KB |
testcase_12 | AC | 1,009 ms
148,868 KB |
testcase_13 | AC | 1,023 ms
150,208 KB |
testcase_14 | AC | 1,016 ms
149,804 KB |
testcase_15 | AC | 1,030 ms
150,108 KB |
testcase_16 | AC | 1,024 ms
149,844 KB |
testcase_17 | AC | 1,035 ms
149,876 KB |
testcase_18 | AC | 1,019 ms
150,188 KB |
testcase_19 | AC | 1,015 ms
149,944 KB |
testcase_20 | AC | 1,033 ms
149,408 KB |
testcase_21 | AC | 1,084 ms
151,016 KB |
testcase_22 | AC | 1,066 ms
150,740 KB |
testcase_23 | AC | 1,060 ms
150,568 KB |
testcase_24 | AC | 1,054 ms
150,616 KB |
testcase_25 | AC | 1,072 ms
150,536 KB |
testcase_26 | AC | 1,252 ms
142,448 KB |
testcase_27 | AC | 1,263 ms
142,404 KB |
testcase_28 | AC | 1,261 ms
142,168 KB |
testcase_29 | AC | 1,231 ms
142,372 KB |
testcase_30 | AC | 1,259 ms
142,232 KB |
testcase_31 | AC | 1,120 ms
141,580 KB |
testcase_32 | AC | 1,106 ms
141,680 KB |
testcase_33 | AC | 1,099 ms
141,812 KB |
testcase_34 | AC | 1,096 ms
141,836 KB |
testcase_35 | AC | 1,099 ms
142,116 KB |
testcase_36 | AC | 844 ms
152,220 KB |
testcase_37 | AC | 844 ms
153,604 KB |
testcase_38 | AC | 831 ms
153,396 KB |
testcase_39 | AC | 843 ms
152,136 KB |
testcase_40 | AC | 863 ms
153,492 KB |
testcase_41 | AC | 1,213 ms
144,856 KB |
testcase_42 | AC | 1,151 ms
145,108 KB |
testcase_43 | AC | 1,160 ms
144,608 KB |
testcase_44 | AC | 1,185 ms
144,772 KB |
testcase_45 | AC | 1,187 ms
144,612 KB |
testcase_46 | AC | 1,148 ms
142,584 KB |
testcase_47 | AC | 1,160 ms
142,164 KB |
testcase_48 | AC | 1,113 ms
142,012 KB |
testcase_49 | AC | 1,133 ms
142,304 KB |
testcase_50 | AC | 1,137 ms
142,268 KB |
testcase_51 | WA | - |
testcase_52 | WA | - |
testcase_53 | WA | - |
testcase_54 | WA | - |
testcase_55 | WA | - |
testcase_56 | WA | - |
testcase_57 | WA | - |
testcase_58 | WA | - |
testcase_59 | WA | - |
testcase_60 | AC | 628 ms
126,644 KB |
testcase_61 | AC | 800 ms
139,292 KB |
testcase_62 | AC | 794 ms
106,408 KB |
testcase_63 | WA | - |
testcase_64 | AC | 1,012 ms
138,972 KB |
testcase_65 | AC | 576 ms
120,804 KB |
testcase_66 | WA | - |
testcase_67 | WA | - |
testcase_68 | AC | 61 ms
68,240 KB |
testcase_69 | WA | - |
testcase_70 | AC | 62 ms
69,740 KB |
ソースコード
from collections import deque # 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()) A=SortedMultiset(map(int,input().split())) change=[-1]*N query=deque() changed=set() bef=-1 for i in range(Q): t,*q=list(map(int,input().split())) if t==1: k,x=q change[k-1]=x changed.add(k-1) if t==2: for j in changed: query.append((A[j],change[j])) change[j]=-1; changed.clear() while query: A.discard(query[-1][0]) A.add(query[-1][1]) query.pop() if t==3: k=q[0] if change[k-1]==-1: print(A[k-1]) else: print(change[k-1])