#836123 (Python3) No.2220 Range Insert & Point Mex

提出ソース

結果

問題	No.2220 Range Insert & Point Mex
ユーザー	stoq
提出日時	2023-01-30 08:31:46
言語	Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0)
結果	AC
実行時間	1,190 ms / 2,000 ms
コード長	4,947 bytes
コンパイル時間	144 ms
コンパイル使用メモリ	11,476 KB
実行使用メモリ	55,700 KB
最終ジャッジ日時	2023-09-28 17:57:31
合計ジャッジ時間	26,556 ms
ジャッジサーバーID （参考情報）	judge11 / judge12

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	36 ms 10,188 KB
testcase_01	AC	35 ms 10,200 KB
testcase_02	AC	36 ms 10,252 KB
testcase_03	AC	37 ms 10,332 KB
testcase_04	AC	35 ms 10,320 KB
testcase_05	AC	36 ms 10,404 KB
testcase_06	AC	36 ms 10,372 KB
testcase_07	AC	35 ms 10,300 KB
testcase_08	AC	36 ms 10,336 KB
testcase_09	AC	36 ms 10,276 KB
testcase_10	AC	37 ms 10,376 KB
testcase_11	AC	36 ms 10,372 KB
testcase_12	AC	36 ms 10,400 KB
testcase_13	AC	947 ms 50,400 KB
testcase_14	AC	940 ms 50,332 KB
testcase_15	AC	952 ms 50,204 KB
testcase_16	AC	941 ms 50,368 KB
testcase_17	AC	937 ms 50,332 KB
testcase_18	AC	949 ms 50,148 KB
testcase_19	AC	939 ms 50,300 KB
testcase_20	AC	955 ms 53,556 KB
testcase_21	AC	944 ms 53,604 KB
testcase_22	AC	953 ms 53,556 KB
testcase_23	AC	1,190 ms 55,700 KB
testcase_24	AC	1,101 ms 48,268 KB
testcase_25	AC	660 ms 40,300 KB
testcase_26	AC	1,150 ms 51,488 KB
testcase_27	AC	977 ms 36,780 KB
testcase_28	AC	213 ms 25,920 KB
testcase_29	AC	207 ms 25,444 KB
testcase_30	AC	209 ms 25,352 KB
testcase_31	AC	659 ms 47,272 KB
testcase_32	AC	684 ms 41,756 KB
testcase_33	AC	690 ms 41,848 KB
testcase_34	AC	1,099 ms 51,316 KB
testcase_35	AC	1,098 ms 51,584 KB
testcase_36	AC	1,127 ms 50,456 KB
testcase_37	AC	1,127 ms 50,660 KB
testcase_38	AC	1,039 ms 53,832 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

# 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, TypeVar, Union, List

T = TypeVar('T')


class SortedSet(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 SortedSet from iterable. / O(N) if sorted and unique / O(N log N)"
        a = list(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 __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 _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 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 = self._find_bucket(x)
        i = bisect_left(a, 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 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


n = int(input())
event = []
for i in range(n):
    l, r, a = map(int, input().split())
    event.append((l, 1, a))
    event.append((r, 3, a))
q = int(input())
x = list(map(int, input().split()))
for i in range(q):
    event.append((x[i], 2, i))
event.sort()
st = SortedSet(range(n + 1))
cnt = [0] * n
ans = [0] * q
for e in event:
    type = e[1]
    num = e[2]
    if type == 1:
        if num >= n:
            continue
        if cnt[num] == 0:
            st.discard(num)
        cnt[num] += 1
    elif type == 2:
        ans[num] = st[0]
    else:
        if num >= n:
            continue
        cnt[num] -= 1
        if cnt[num] == 0:
            st.add(num)
for a in ans:
    print(a)

yukicoder

結果

テストケース

ソースコード