結果

問題 No.2804 Fixer And Ratism
ユーザー N-noa21N-noa21
提出日時 2024-09-30 14:08:41
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 179 ms / 2,000 ms
コード長 5,973 bytes
コンパイル時間 226 ms
コンパイル使用メモリ 82,048 KB
実行使用メモリ 79,084 KB
最終ジャッジ日時 2024-09-30 14:08:49
合計ジャッジ時間 5,832 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 59 ms
67,840 KB
testcase_01 AC 59 ms
67,712 KB
testcase_02 AC 60 ms
67,584 KB
testcase_03 AC 112 ms
78,592 KB
testcase_04 AC 108 ms
78,464 KB
testcase_05 AC 99 ms
78,464 KB
testcase_06 AC 139 ms
78,464 KB
testcase_07 AC 101 ms
78,976 KB
testcase_08 AC 106 ms
79,040 KB
testcase_09 AC 95 ms
78,616 KB
testcase_10 AC 99 ms
78,620 KB
testcase_11 AC 136 ms
78,848 KB
testcase_12 AC 121 ms
78,740 KB
testcase_13 AC 103 ms
78,960 KB
testcase_14 AC 115 ms
78,912 KB
testcase_15 AC 114 ms
78,288 KB
testcase_16 AC 122 ms
78,848 KB
testcase_17 AC 104 ms
79,084 KB
testcase_18 AC 138 ms
78,592 KB
testcase_19 AC 91 ms
78,328 KB
testcase_20 AC 91 ms
78,848 KB
testcase_21 AC 136 ms
78,592 KB
testcase_22 AC 86 ms
78,720 KB
testcase_23 AC 157 ms
78,592 KB
testcase_24 AC 170 ms
78,804 KB
testcase_25 AC 155 ms
78,464 KB
testcase_26 AC 150 ms
78,848 KB
testcase_27 AC 152 ms
79,012 KB
testcase_28 AC 155 ms
78,848 KB
testcase_29 AC 155 ms
79,016 KB
testcase_30 AC 158 ms
78,720 KB
testcase_31 AC 157 ms
78,464 KB
testcase_32 AC 179 ms
78,592 KB
testcase_33 AC 56 ms
67,840 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

# 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())
pc = N
fixed = SortedMultiset([])
member = SortedMultiset([])
from collections import defaultdict
d = defaultdict(int)
for i in range(Q):
    query = input().split()

    if query[0] == "1":
        s,r = query[1],int(query[2])
        member.add((r,s))
        d[s] = r
        tmp = []
        while len(fixed)+len(member) > pc:

            if len(member) > 0:
                r,s = member.pop(0)
                tmp.append((r,s))
            else:
                r,s = fixed.pop(0)
                tmp.append((r,s))
        tmp.sort()
        for r,s in tmp:
            print(s)
    
    elif query[0] == "2":
        pc -= int(query[1])
        tmp = []
        while len(fixed)+len(member) > pc:

            if len(member) > 0:
                r,s = member.pop(0)
                tmp.append((r,s))
            else:
                r,s = fixed.pop(0)
                tmp.append((r,s))
        tmp.sort()
        for r,s in tmp:
            print(s)


    elif query[0] == "3":
        s,x = query[1],int(query[2])
        pc += x
        if (d[s],s) in member:
            member.discard((d[s],s))
            fixed.add((d[s],s))
    #print(member)
    #print(fixed)
    #print(" ")
0