結果

問題 No.2804 Fixer And Ratism
ユーザー titiatitia
提出日時 2024-07-13 02:06:12
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 226 ms / 2,000 ms
コード長 5,643 bytes
コンパイル時間 867 ms
コンパイル使用メモリ 82,156 KB
実行使用メモリ 79,732 KB
最終ジャッジ日時 2024-07-13 02:06:21
合計ジャッジ時間 8,440 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 65 ms
69,032 KB
testcase_01 AC 66 ms
68,628 KB
testcase_02 AC 67 ms
69,320 KB
testcase_03 AC 163 ms
79,344 KB
testcase_04 AC 173 ms
79,504 KB
testcase_05 AC 139 ms
79,096 KB
testcase_06 AC 140 ms
78,396 KB
testcase_07 AC 133 ms
79,168 KB
testcase_08 AC 113 ms
78,744 KB
testcase_09 AC 114 ms
78,620 KB
testcase_10 AC 139 ms
79,228 KB
testcase_11 AC 205 ms
79,540 KB
testcase_12 AC 167 ms
79,212 KB
testcase_13 AC 157 ms
79,152 KB
testcase_14 AC 169 ms
79,444 KB
testcase_15 AC 111 ms
78,220 KB
testcase_16 AC 166 ms
79,668 KB
testcase_17 AC 144 ms
79,228 KB
testcase_18 AC 187 ms
79,608 KB
testcase_19 AC 102 ms
78,216 KB
testcase_20 AC 101 ms
79,040 KB
testcase_21 AC 204 ms
79,316 KB
testcase_22 AC 92 ms
78,600 KB
testcase_23 AC 221 ms
79,000 KB
testcase_24 AC 165 ms
78,608 KB
testcase_25 AC 220 ms
79,204 KB
testcase_26 AC 209 ms
79,320 KB
testcase_27 AC 170 ms
78,472 KB
testcase_28 AC 226 ms
79,732 KB
testcase_29 AC 194 ms
79,016 KB
testcase_30 AC 193 ms
78,996 KB
testcase_31 AC 192 ms
78,904 KB
testcase_32 AC 220 ms
79,404 KB
testcase_33 AC 67 ms
69,492 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys
input = sys.stdin.readline

from heapq import heappop,heappush

# https://github.com/tatyam-prime/SortedSet/blob/main/SortedSet.py
import math
from bisect import bisect_left, bisect_right
from typing import Generic, Iterable, Iterator, List, Tuple, TypeVar, Optional
T = TypeVar('T')

class SortedSet(Generic[T]):
    BUCKET_RATIO = 16
    SPLIT_RATIO = 24
    
    def __init__(self, a: Iterable[T] = []) -> None:
        "Make a new SortedSet from iterable. / O(N) if sorted and unique / O(N log N)"
        a = list(a)
        n = len(a)
        if any(a[i] > a[i + 1] for i in range(n - 1)):
            a.sort()
        if any(a[i] >= a[i + 1] for i in range(n - 1)):
            a, b = [], a
            for x in b:
                if not a or a[-1] != x:
                    a.append(x)
        n = self.size = len(a)
        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 "SortedSet" + 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 add(self, x: T) -> bool:
        "Add an element and return True if added. / O(√N)"
        if self.size == 0:
            self.a = [[x]]
            self.size = 1
            return True
        a, b, i = self._position(x)
        if i != len(a) and a[i] == x: return False
        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:]]
        return True
    
    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=SortedSet()
B=SortedSet()
D=dict()

for tests in range(Q):
    L=input().split()
    LIST=[]

    if L[0]=="1":
        s,r=L[1],L[2]
        r=int(r)

        D[s]=r

        A.add((r,s))
    elif L[0]=="2":
        x=int(L[1])
        N-=x
    else:
        s,x=L[1],L[2]
        x=int(x)
        r=D[s]
        N+=x

        A.discard((r,s))
        B.add((r,s))

    while len(A)+len(B)>N:
        if len(A)>0:
            r,s=A.pop(0)
            LIST.append((r,s))
        else:
            r,s=B.pop(0)
            LIST.append((r,s))

    LIST.sort()
    for r,s in LIST:
        print(s)
0