結果

問題 No.2809 Sort Query
ユーザー titiatitia
提出日時 2024-07-17 01:39:56
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,474 ms / 2,000 ms
コード長 5,976 bytes
コンパイル時間 468 ms
コンパイル使用メモリ 82,796 KB
実行使用メモリ 189,108 KB
最終ジャッジ日時 2024-07-17 01:41:22
合計ジャッジ時間 71,470 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 66 ms
67,712 KB
testcase_01 AC 837 ms
131,584 KB
testcase_02 AC 831 ms
131,584 KB
testcase_03 AC 829 ms
132,096 KB
testcase_04 AC 821 ms
131,712 KB
testcase_05 AC 837 ms
131,784 KB
testcase_06 AC 834 ms
125,252 KB
testcase_07 AC 842 ms
125,252 KB
testcase_08 AC 874 ms
125,440 KB
testcase_09 AC 845 ms
125,836 KB
testcase_10 AC 860 ms
125,248 KB
testcase_11 AC 1,398 ms
185,320 KB
testcase_12 AC 1,350 ms
189,108 KB
testcase_13 AC 1,395 ms
185,488 KB
testcase_14 AC 1,414 ms
185,256 KB
testcase_15 AC 1,333 ms
185,360 KB
testcase_16 AC 1,394 ms
185,548 KB
testcase_17 AC 1,336 ms
185,580 KB
testcase_18 AC 1,367 ms
185,132 KB
testcase_19 AC 1,344 ms
185,716 KB
testcase_20 AC 1,351 ms
186,276 KB
testcase_21 AC 1,474 ms
183,160 KB
testcase_22 AC 1,369 ms
185,548 KB
testcase_23 AC 1,429 ms
183,504 KB
testcase_24 AC 1,374 ms
182,712 KB
testcase_25 AC 1,406 ms
184,824 KB
testcase_26 AC 1,080 ms
163,020 KB
testcase_27 AC 972 ms
164,772 KB
testcase_28 AC 960 ms
163,908 KB
testcase_29 AC 1,042 ms
163,772 KB
testcase_30 AC 1,009 ms
163,368 KB
testcase_31 AC 788 ms
171,504 KB
testcase_32 AC 759 ms
171,136 KB
testcase_33 AC 687 ms
170,356 KB
testcase_34 AC 682 ms
171,304 KB
testcase_35 AC 736 ms
171,824 KB
testcase_36 AC 814 ms
186,132 KB
testcase_37 AC 886 ms
186,512 KB
testcase_38 AC 816 ms
184,996 KB
testcase_39 AC 860 ms
184,256 KB
testcase_40 AC 830 ms
184,820 KB
testcase_41 AC 576 ms
131,912 KB
testcase_42 AC 511 ms
132,560 KB
testcase_43 AC 579 ms
133,256 KB
testcase_44 AC 579 ms
132,096 KB
testcase_45 AC 528 ms
132,076 KB
testcase_46 AC 528 ms
132,776 KB
testcase_47 AC 542 ms
133,620 KB
testcase_48 AC 522 ms
132,712 KB
testcase_49 AC 506 ms
132,728 KB
testcase_50 AC 512 ms
132,816 KB
testcase_51 AC 420 ms
131,656 KB
testcase_52 AC 387 ms
132,028 KB
testcase_53 AC 437 ms
131,676 KB
testcase_54 AC 395 ms
132,216 KB
testcase_55 AC 427 ms
131,556 KB
testcase_56 AC 681 ms
125,904 KB
testcase_57 AC 616 ms
115,244 KB
testcase_58 AC 561 ms
114,856 KB
testcase_59 AC 571 ms
112,040 KB
testcase_60 AC 502 ms
130,828 KB
testcase_61 AC 575 ms
126,624 KB
testcase_62 AC 555 ms
114,120 KB
testcase_63 AC 655 ms
126,552 KB
testcase_64 AC 737 ms
126,580 KB
testcase_65 AC 433 ms
117,912 KB
testcase_66 AC 60 ms
69,048 KB
testcase_67 AC 58 ms
67,844 KB
testcase_68 AC 62 ms
69,632 KB
testcase_69 AC 58 ms
68,200 KB
testcase_70 AC 58 ms
68,904 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys
input = sys.stdin.readline

N,Q=map(int,input().split())
A=list(map(int,input().split()))

# 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

Query=[list(map(int,input().split())) for i in range(Q)]

ind=0

while ind<len(Query):
    if Query[ind][0]==2:
        break

    if Query[ind][0]==3:
        x=Query[ind][1]
        x-=1
        print(A[x])
    else:
        x,k=Query[ind][1],Query[ind][2]
        x-=1
        A[x]=k
    ind+=1

S=SortedMultiset(A)
D=dict()
ind+=1

while ind<len(Query):
    #print(len(S),S)
    ADD=[]
    REMOVE=[]
    D=dict()
    ind2=-1
    while ind<len(Query):
        if Query[ind][0]==2:
            ind2=ind
            break

        if Query[ind][0]==3:
            x=Query[ind][1]
            x-=1
            if x in D:
                print(D[x])
            else:
                print(S[x])
        else:
            x,k=Query[ind][1],Query[ind][2]
            x-=1
            if x in D:
                REMOVE.append(D[x])
            else:
                REMOVE.append(S[x])
            D[x]=k
            ADD.append(k)
        ind+=1

    #print(len(REMOVE),len(ADD),REMOVE,ADD)

    for a in ADD:
        S.add(a)

    for r in REMOVE:
        S.discard(r)


    if ind2==-1:
        break

    ind=ind2+1
0