結果

問題 No.2804 Fixer And Ratism
ユーザー detteiuudetteiuu
提出日時 2024-07-12 21:21:12
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 228 ms / 2,000 ms
コード長 5,868 bytes
コンパイル時間 1,073 ms
コンパイル使用メモリ 81,920 KB
実行使用メモリ 101,248 KB
最終ジャッジ日時 2024-07-12 21:21:23
合計ジャッジ時間 7,023 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 65 ms
67,456 KB
testcase_01 AC 63 ms
67,328 KB
testcase_02 AC 63 ms
67,712 KB
testcase_03 AC 141 ms
83,896 KB
testcase_04 AC 127 ms
84,352 KB
testcase_05 AC 106 ms
78,848 KB
testcase_06 AC 187 ms
94,720 KB
testcase_07 AC 125 ms
83,904 KB
testcase_08 AC 135 ms
84,016 KB
testcase_09 AC 102 ms
78,848 KB
testcase_10 AC 111 ms
78,976 KB
testcase_11 AC 186 ms
93,252 KB
testcase_12 AC 160 ms
89,344 KB
testcase_13 AC 110 ms
78,848 KB
testcase_14 AC 155 ms
88,704 KB
testcase_15 AC 102 ms
79,104 KB
testcase_16 AC 164 ms
88,960 KB
testcase_17 AC 129 ms
83,424 KB
testcase_18 AC 202 ms
97,408 KB
testcase_19 AC 102 ms
78,592 KB
testcase_20 AC 104 ms
78,720 KB
testcase_21 AC 195 ms
94,080 KB
testcase_22 AC 94 ms
78,976 KB
testcase_23 AC 228 ms
98,432 KB
testcase_24 AC 213 ms
97,920 KB
testcase_25 AC 223 ms
101,120 KB
testcase_26 AC 207 ms
98,432 KB
testcase_27 AC 209 ms
98,144 KB
testcase_28 AC 223 ms
101,248 KB
testcase_29 AC 218 ms
98,056 KB
testcase_30 AC 219 ms
98,048 KB
testcase_31 AC 214 ms
98,348 KB
testcase_32 AC 212 ms
97,792 KB
testcase_33 AC 61 ms
67,456 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

# 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())
query = [list(input().split()) for _ in range(Q)]

one = SortedSet()
two = SortedSet()
cnt = 0
D = dict()
for i in range(Q):
    if query[i][0] == "1":
        name, rate = query[i][1:]
        rate = int(rate)
        two.add((rate, name))
        D[name] = rate
        cnt += 1
    elif query[i][0] == "2":
        c = int(query[i][1])
        N -= c
    else:
        name, c = query[i][1:]
        c = int(c)
        if (D[name], name) in two:
            two.discard((D[name], name))
            one.add((D[name], name))
        N += c
    if cnt > N:
        ans = []
        while two and cnt > N:
            rate, name = two.pop(0)
            ans.append((rate, name))
            cnt -= 1
        while one and cnt > N:
            rate, name = one.pop(0)
            ans.append((rate, name))
            cnt -= 1
        ans.sort(key=lambda x:x[0])
        for rate, name in ans:
            print(name)
0