#941320 (PyPy3) No.2220 Range Insert & Point Mex

提出ソース

結果

問題	No.2220 Range Insert & Point Mex
ユーザー	lloyz
提出日時	2023-12-31 01:07:20
言語	PyPy3 (7.3.15)
結果	AC
実行時間	908 ms / 2,000 ms
コード長	5,567 bytes
コンパイル時間	428 ms
コンパイル使用メモリ	82,288 KB
実行使用メモリ	138,388 KB
最終ジャッジ日時	2024-09-27 16:58:06
合計ジャッジ時間	19,712 ms
ジャッジサーバーID （参考情報）	judge1 / judge3

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	57 ms 69,292 KB
testcase_01	AC	55 ms 68,332 KB
testcase_02	AC	55 ms 68,188 KB
testcase_03	AC	57 ms 68,640 KB
testcase_04	AC	56 ms 68,104 KB
testcase_05	AC	56 ms 69,064 KB
testcase_06	AC	57 ms 70,100 KB
testcase_07	AC	55 ms 69,128 KB
testcase_08	AC	55 ms 69,892 KB
testcase_09	AC	57 ms 68,664 KB
testcase_10	AC	58 ms 69,312 KB
testcase_11	AC	55 ms 68,864 KB
testcase_12	AC	55 ms 69,060 KB
testcase_13	AC	750 ms 137,068 KB
testcase_14	AC	748 ms 136,408 KB
testcase_15	AC	794 ms 136,616 KB
testcase_16	AC	789 ms 136,940 KB
testcase_17	AC	771 ms 136,880 KB
testcase_18	AC	758 ms 136,740 KB
testcase_19	AC	764 ms 136,232 KB
testcase_20	AC	741 ms 125,572 KB
testcase_21	AC	755 ms 125,780 KB
testcase_22	AC	778 ms 125,648 KB
testcase_23	AC	484 ms 133,772 KB
testcase_24	AC	457 ms 117,440 KB
testcase_25	AC	315 ms 122,924 KB
testcase_26	AC	453 ms 134,120 KB
testcase_27	AC	391 ms 100,840 KB
testcase_28	AC	126 ms 107,356 KB
testcase_29	AC	133 ms 111,980 KB
testcase_30	AC	134 ms 111,864 KB
testcase_31	AC	336 ms 131,020 KB
testcase_32	AC	321 ms 113,344 KB
testcase_33	AC	330 ms 113,612 KB
testcase_34	AC	814 ms 135,356 KB
testcase_35	AC	823 ms 135,828 KB
testcase_36	AC	809 ms 138,388 KB
testcase_37	AC	908 ms 136,976 KB
testcase_38	AC	504 ms 137,180 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, 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 = self.size = 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)
        bucket_size = int(math.ceil(math.sqrt(n / self.BUCKET_RATIO)))
        self.a = [a[n * i // bucket_size : n * (i + 1) // bucket_size] for i in range(bucket_size)]

    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 = int(input())
L = []
for _ in range(n):
    l, r, a = map(int, input().split())
    L.append((l, 1, a))
    L.append((r, 3, a))
q = int(input())
X = list(map(int, input().split()))
for i in range(q):
    L.append((X[i], 2, i))
L.sort()
S = SortedSet(range(n + 1))
C = [0 for _ in range(n)]
ANS = [0 for _ in range(q)]
for idx, mode, num in L:
    if mode == 1:
        if num >= n:
            continue
        if C[num] == 0:
            S.discard(num)
        C[num] += 1
    elif mode == 2:
        ANS[num] = S[0]
    else:
        if num >= n:
            continue
        C[num] -= 1
        if C[num] == 0:
            S.add(num)
print(*ANS, sep='\n')

yukicoder

結果

テストケース

ソースコード