#849519 (PyPy3) No.2292 Interval Union Find

提出ソース

結果

問題	No.2292 Interval Union Find
ユーザー	t98slider
提出日時	2023-03-16 03:56:19
言語	PyPy3 (7.3.15)
結果	WA (最新) AC (最初)
実行時間	-
コード長	5,556 bytes
コンパイル時間	1,089 ms
コンパイル使用メモリ	82,432 KB
実行使用メモリ	124,552 KB
最終ジャッジ日時	2024-09-22 02:26:23
合計ジャッジ時間	33,875 ms
ジャッジサーバーID （参考情報）	judge2 / judge4

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	73 ms 67,712 KB
testcase_01	AC	72 ms 67,584 KB
testcase_02	AC	73 ms 67,712 KB
testcase_03	WA	-
testcase_04	AC	638 ms 87,304 KB
testcase_05	AC	981 ms 92,764 KB
testcase_06	AC	687 ms 87,624 KB
testcase_07	AC	891 ms 91,572 KB
testcase_08	AC	708 ms 88,656 KB
testcase_09	AC	584 ms 85,056 KB
testcase_10	AC	700 ms 87,024 KB
testcase_11	AC	681 ms 86,720 KB
testcase_12	AC	903 ms 90,452 KB
testcase_13	AC	624 ms 86,508 KB
testcase_14	AC	683 ms 87,596 KB
testcase_15	AC	733 ms 87,464 KB
testcase_16	AC	687 ms 87,320 KB
testcase_17	AC	638 ms 86,380 KB
testcase_18	WA	-
testcase_19	WA	-
testcase_20	AC	684 ms 124,552 KB
testcase_21	WA	-
testcase_22	WA	-
testcase_23	WA	-
testcase_24	WA	-
testcase_25	WA	-
testcase_26	WA	-
testcase_27	WA	-
testcase_28	WA	-
testcase_29	WA	-
testcase_30	WA	-
testcase_31	WA	-
testcase_32	WA	-
testcase_33	WA	-
testcase_34	WA	-
testcase_35	WA	-
testcase_36	WA	-
testcase_37	WA	-
testcase_38	WA	-
testcase_39	WA	-
testcase_40	WA	-
testcase_41	WA	-
testcase_42	WA	-
testcase_43	WA	-
testcase_44	WA	-
testcase_45	WA	-
testcase_46	WA	-
testcase_47	WA	-

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

ソースコード

raw source code

# https://github.com/tatyam-prime/SortedSet/blob/main/SortedSet.py
import math
from sys import stdin
from bisect import bisect_left, bisect_right
from typing import Generic, Iterable, Iterator, TypeVar, Optional, 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) -> 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, 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, Q = map(int, input().split())

lst = (N + 2) * (N + 2) + N + 1
S = SortedSet([lst])

for _ in range(Q):
    query = list(map(int, stdin.readline().split()))
    if query[0] == 1:
        L, R = query[1], query[2]

        v = S.ge(L * (N + 2))
        l, r = v % (N + 2), v // (N + 2)

        while l <= R:
            L = min(L, l)
            R = max(R, r)
            S.discard(v)
            v = S.ge(L * (N + 2))
            l, r = v % (N + 2), v // (N + 2)
        
        S.add(R * (N + 2) + L)
    elif query[0] == 2:
        L, R = query[1], query[2]

        v = S.ge((L + 1) * (N + 2))
        l, r = v % (N + 2), v // (N + 2)
        
        while l < R:
            if l < L: S.add(L * (N + 2) + l)
            if R < r: S.add(r * (N + 2) + R)
            S.discard(v)
            v = S.ge((L + 1) * (N + 2))
            l, r = v % (N + 2), v // (N + 2)

    elif query[0] == 3:
        u, v = query[1], query[2]
        if u > v : u, v = v, u
        tmp = S.ge(u * (N + 2))
        l, r = tmp % (N + 2), tmp // (N + 2)

        if l <= u and v <= r:
            print(1)
        else:
            print(0)
    else:
        v = query[1]
        tmp = S.gt(v * (N + 2))
        l, r = tmp % (N + 2), tmp // (N + 2)
        if l <= v and v <= r:
            print(r - l + 1)
        else:
            print(1)

yukicoder

結果

テストケース

ソースコード