結果

問題 No.2804 Fixer And Ratism
ユーザー tkykwtnbtkykwtnb
提出日時 2024-07-12 22:40:08
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 5,309 bytes
コンパイル時間 330 ms
コンパイル使用メモリ 82,780 KB
実行使用メモリ 80,340 KB
最終ジャッジ日時 2024-07-12 22:40:24
合計ジャッジ時間 8,935 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 69 ms
67,924 KB
testcase_01 AC 65 ms
69,060 KB
testcase_02 AC 66 ms
68,928 KB
testcase_03 WA -
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 AC 133 ms
79,308 KB
testcase_10 WA -
testcase_11 AC 285 ms
79,876 KB
testcase_12 WA -
testcase_13 AC 169 ms
79,832 KB
testcase_14 AC 226 ms
79,868 KB
testcase_15 WA -
testcase_16 WA -
testcase_17 AC 175 ms
79,308 KB
testcase_18 WA -
testcase_19 AC 120 ms
79,528 KB
testcase_20 WA -
testcase_21 AC 274 ms
79,856 KB
testcase_22 WA -
testcase_23 AC 293 ms
79,732 KB
testcase_24 WA -
testcase_25 AC 294 ms
80,088 KB
testcase_26 WA -
testcase_27 WA -
testcase_28 AC 308 ms
80,296 KB
testcase_29 WA -
testcase_30 WA -
testcase_31 WA -
testcase_32 AC 298 ms
80,140 KB
testcase_33 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

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 = 50
    REBUILD_RATIO = 170
    def _build(self, a: Optional[List[T]] = None) -> None:
        "Evenly divide `a` into buckets."
        if a is None: a = list(self)
        size = len(a)
        bucket_size = int(math.ceil(math.sqrt(size / self.BUCKET_RATIO)))
        self.a = [a[size * i // bucket_size : size * (i + 1) // bucket_size] for i in range(bucket_size)]
    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)
        self.size = len(a)
        if not all(a[i] < a[i + 1] for i in range(len(a) - 1)):
            a = sorted(set(a))
        self._build(a)
    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]:
        "Find the bucket and position which x should be inserted. self must not be empty."
        for a in self.a:
            if x <= a[-1]: break
        return (a, 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, 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.REBUILD_RATIO:
            self._build()
        return True
    def _pop(self, a: List[T], i: int) -> T:
        ans = a.pop(i)
        self.size -= 1
        if not a: self._build()
        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, i = self._position(x)
        if i == len(a) or a[i] != x: return False
        self._pop(a, 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 a in reversed(self.a):
                i += len(a)
                if i >= 0: return self._pop(a, i)
        else:
            for a in self.a:
                if i < len(a): return self._pop(a, 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
from collections import defaultdict
N,Q=map(int,input().split())
available=N
user=SortedSet([])
rating=defaultdict(int)
for _ in range(Q):
    q=list(input().split())
    if q[0]=="1":
        rating[q[1]]=int(q[2])-4000
        user.add((rating[q[1]],q[1]))
        if len(user)>available:
            ans=user.pop(0)
            print(ans[1])
    elif q[0]=="2":
        available-=int(q[1])
        while len(user)>available:
            ans=user.pop(0)
            print(ans[1])
    else:
        available+=int(q[2])
        user.discard((rating[q[1]],q[1]))
        rating[q[1]]+=4000
        user.add((rating[q[1]],q[1]))
        pass
0