結果

問題 No.833 かっこいい電車
ユーザー stngstng
提出日時 2022-07-10 16:37:45
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 364 ms / 2,000 ms
コード長 5,254 bytes
コンパイル時間 142 ms
コンパイル使用メモリ 82,120 KB
実行使用メモリ 98,720 KB
最終ジャッジ日時 2024-06-11 05:47:55
合計ジャッジ時間 8,339 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 238 ms
92,288 KB
testcase_01 AC 58 ms
67,968 KB
testcase_02 AC 58 ms
67,712 KB
testcase_03 AC 57 ms
67,968 KB
testcase_04 AC 57 ms
67,712 KB
testcase_05 AC 59 ms
67,456 KB
testcase_06 AC 57 ms
67,584 KB
testcase_07 AC 58 ms
67,840 KB
testcase_08 AC 59 ms
67,328 KB
testcase_09 AC 56 ms
67,712 KB
testcase_10 AC 311 ms
90,676 KB
testcase_11 AC 339 ms
98,220 KB
testcase_12 AC 216 ms
84,836 KB
testcase_13 AC 217 ms
83,148 KB
testcase_14 AC 321 ms
95,836 KB
testcase_15 AC 241 ms
85,212 KB
testcase_16 AC 200 ms
84,180 KB
testcase_17 AC 266 ms
85,444 KB
testcase_18 AC 352 ms
91,832 KB
testcase_19 AC 201 ms
84,392 KB
testcase_20 AC 111 ms
79,500 KB
testcase_21 AC 325 ms
90,816 KB
testcase_22 AC 251 ms
92,652 KB
testcase_23 AC 206 ms
84,696 KB
testcase_24 AC 251 ms
92,852 KB
testcase_25 AC 364 ms
91,828 KB
testcase_26 AC 202 ms
84,980 KB
testcase_27 AC 289 ms
88,020 KB
testcase_28 AC 247 ms
85,932 KB
testcase_29 AC 271 ms
86,704 KB
testcase_30 AC 260 ms
98,720 KB
testcase_31 AC 242 ms
92,440 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys
input = sys.stdin.readline

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

class SortedMultiset(Generic[T]):
    BUCKET_RATIO = 50
    REBUILD_RATIO = 170

    def _build(self, a=None) -> None:
        "Evenly divide `a` into buckets."
        if a is None: a = list(self)
        size = 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 SortedMultiset from iterable. / O(N) if sorted / O(N log N)"
        a = list(a)
        if not all(a[i] <= a[i + 1] for i in range(len(a) - 1)):
            a = sorted(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 __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 _find_bucket(self, x: T) -> List[T]:
        "Find the bucket which should contain x. self must not be empty."
        for a in self.a:
            if x <= a[-1]: return a
        return a

    def __contains__(self, x: T) -> bool:
        if self.size == 0: return False
        a = self._find_bucket(x)
        i = bisect_left(a, 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 = self._find_bucket(x)
        insort(a, x)
        self.size += 1
        if len(a) > len(self.a) * self.REBUILD_RATIO:
            self._build()

    def discard(self, x: T) -> bool:
        "Remove an element and return True if removed. / O(√N)"
        if self.size == 0: return False
        a = self._find_bucket(x)
        i = bisect_left(a, x)
        if i == len(a) or a[i] != x: return False
        a.pop(i)
        self.size -= 1
        if len(a) == 0: self._build()
        return True

    def lt(self, x: T) -> Union[T, None]:
        "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) -> Union[T, None]:
        "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) -> Union[T, None]:
        "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) -> Union[T, None]:
        "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, x: int) -> T:
        "Return the x-th element, or IndexError if it doesn't exist."
        if x < 0: x += self.size
        if x < 0: raise IndexError
        for a in self.a:
            if x < len(a): return a[x]
            x -= 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



class Bit:
    def __init__(self, n):
        self.size = n
        self.tree = [0] * (n + 1)
 
    def sum(self, i):
        s = 0
        while i > 0:
            s += self.tree[i]
            i -= i & -i
        return s
 
    def add(self, i, x):
        while i <= self.size:
            self.tree[i] += x
            i += i & -i

n,q = map(int,input().split())
a = [int(i) for i in input().split()]
qry = [[int(i) for i in input().split()] for j in range(q)]

bit = Bit(n+1)     # 要素数を与えてインスタンス化
st = SortedMultiset()

for i in range(n):
    bit.add(i+1,a[i])

#for i in range(n+1):
#    print(bit.sum(i),i)

#exit()

for i in range(n+1):
    st.add(i)

for i in range(q):
    q,x = qry[i]
    if q == 1:
        st.discard(x)
    if q == 2:
        if x not in st:
            st.add(x)
    if q == 3:
        bit.add(x,1)
    if q == 4:
        r = st.ge(x)
        l = st.lt(x)
        #print(idx,x,1111)
        print(bit.sum(r)-bit.sum(l))
0