#976466 (PyPy3) No.2809 Sort Query

提出ソース

結果

問題	No.2809 Sort Query
ユーザー	highlighter
提出日時	2024-04-21 17:06:23
言語	PyPy3 (7.3.15)
結果	WA (最新) AC (最初)
実行時間	-
コード長	5,398 bytes
コンパイル時間	611 ms
コンパイル使用メモリ	82,276 KB
実行使用メモリ	153,704 KB
最終ジャッジ日時	2024-07-12 20:52:27
合計ジャッジ時間	80,001 ms
ジャッジサーバーID （参考情報）	judge1 / judge4

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	67 ms 67,584 KB
testcase_01	AC	1,172 ms 142,928 KB
testcase_02	AC	1,069 ms 142,664 KB
testcase_03	WA	-
testcase_04	WA	-
testcase_05	WA	-
testcase_06	AC	1,077 ms 136,112 KB
testcase_07	WA	-
testcase_08	WA	-
testcase_09	AC	1,059 ms 136,640 KB
testcase_10	AC	1,017 ms 136,812 KB
testcase_11	AC	992 ms 149,924 KB
testcase_12	AC	933 ms 149,000 KB
testcase_13	AC	969 ms 150,064 KB
testcase_14	AC	961 ms 149,812 KB
testcase_15	AC	947 ms 149,908 KB
testcase_16	AC	950 ms 149,724 KB
testcase_17	AC	959 ms 150,048 KB
testcase_18	AC	957 ms 150,072 KB
testcase_19	AC	948 ms 150,032 KB
testcase_20	AC	974 ms 149,456 KB
testcase_21	AC	1,030 ms 150,596 KB
testcase_22	AC	1,033 ms 150,616 KB
testcase_23	AC	977 ms 150,496 KB
testcase_24	AC	1,023 ms 150,652 KB
testcase_25	AC	998 ms 150,364 KB
testcase_26	AC	1,227 ms 142,044 KB
testcase_27	AC	1,194 ms 142,172 KB
testcase_28	AC	1,180 ms 142,560 KB
testcase_29	AC	1,231 ms 142,308 KB
testcase_30	AC	1,220 ms 142,536 KB
testcase_31	AC	1,064 ms 141,400 KB
testcase_32	AC	1,106 ms 141,920 KB
testcase_33	AC	1,063 ms 142,004 KB
testcase_34	AC	1,070 ms 141,500 KB
testcase_35	AC	1,066 ms 141,676 KB
testcase_36	AC	777 ms 152,068 KB
testcase_37	AC	784 ms 153,284 KB
testcase_38	AC	779 ms 153,444 KB
testcase_39	AC	790 ms 152,288 KB
testcase_40	AC	801 ms 153,704 KB
testcase_41	AC	1,160 ms 144,592 KB
testcase_42	AC	1,128 ms 144,984 KB
testcase_43	AC	1,108 ms 144,848 KB
testcase_44	AC	1,146 ms 144,620 KB
testcase_45	AC	1,125 ms 144,588 KB
testcase_46	AC	1,100 ms 142,420 KB
testcase_47	AC	1,091 ms 142,036 KB
testcase_48	AC	1,043 ms 141,916 KB
testcase_49	AC	1,059 ms 142,040 KB
testcase_50	AC	1,095 ms 142,032 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	596 ms 125,944 KB
testcase_61	AC	846 ms 138,912 KB
testcase_62	AC	807 ms 106,608 KB
testcase_63	WA	-
testcase_64	AC	977 ms 139,048 KB
testcase_65	AC	539 ms 120,764 KB
testcase_66	WA	-
testcase_67	WA	-
testcase_68	AC	64 ms 67,712 KB
testcase_69	WA	-
testcase_70	AC	64 ms 67,328 KB

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

ソースコード

raw source code

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])

yukicoder

結果

テストケース

ソースコード