#866595 (PyPy3) No.2292 Interval Union Find

提出ソース

結果

問題	No.2292 Interval Union Find
ユーザー	とりゐ
提出日時	2023-05-05 22:42:58
言語	PyPy3 (7.3.15)
結果	AC
実行時間	3,758 ms / 5,000 ms
コード長	5,508 bytes
コンパイル時間	397 ms
コンパイル使用メモリ	82,048 KB
実行使用メモリ	142,520 KB
最終ジャッジ日時	2024-09-26 03:13:12
合計ジャッジ時間	95,250 ms
ジャッジサーバーID （参考情報）	judge1 / judge3

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	62 ms 67,968 KB
testcase_01	AC	62 ms 67,584 KB
testcase_02	AC	62 ms 67,968 KB
testcase_03	AC	61 ms 67,968 KB
testcase_04	AC	1,060 ms 95,828 KB
testcase_05	AC	1,882 ms 101,208 KB
testcase_06	AC	889 ms 93,236 KB
testcase_07	AC	1,505 ms 101,576 KB
testcase_08	AC	1,077 ms 91,908 KB
testcase_09	AC	1,154 ms 93,672 KB
testcase_10	AC	1,078 ms 95,052 KB
testcase_11	AC	885 ms 89,388 KB
testcase_12	AC	1,583 ms 101,128 KB
testcase_13	AC	902 ms 94,976 KB
testcase_14	AC	960 ms 94,196 KB
testcase_15	AC	947 ms 91,316 KB
testcase_16	AC	1,036 ms 92,272 KB
testcase_17	AC	1,017 ms 89,992 KB
testcase_18	AC	2,472 ms 126,512 KB
testcase_19	AC	3,199 ms 110,728 KB
testcase_20	AC	3,758 ms 142,520 KB
testcase_21	AC	2,808 ms 108,588 KB
testcase_22	AC	2,899 ms 110,652 KB
testcase_23	AC	2,933 ms 111,744 KB
testcase_24	AC	2,859 ms 108,912 KB
testcase_25	AC	2,826 ms 108,176 KB
testcase_26	AC	2,869 ms 109,848 KB
testcase_27	AC	2,864 ms 109,924 KB
testcase_28	AC	2,944 ms 113,648 KB
testcase_29	AC	2,951 ms 109,388 KB
testcase_30	AC	2,928 ms 109,396 KB
testcase_31	AC	2,828 ms 108,480 KB
testcase_32	AC	2,848 ms 109,100 KB
testcase_33	AC	2,794 ms 111,040 KB
testcase_34	AC	2,817 ms 108,236 KB
testcase_35	AC	2,839 ms 111,088 KB
testcase_36	AC	2,877 ms 108,300 KB
testcase_37	AC	2,874 ms 110,260 KB
testcase_38	AC	2,842 ms 110,944 KB
testcase_39	AC	2,933 ms 110,724 KB
testcase_40	AC	2,836 ms 108,948 KB
testcase_41	AC	347 ms 84,012 KB
testcase_42	AC	519 ms 87,840 KB
testcase_43	AC	1,189 ms 98,120 KB
testcase_44	AC	1,178 ms 101,252 KB
testcase_45	AC	1,011 ms 96,420 KB
testcase_46	AC	1,094 ms 98,032 KB
testcase_47	AC	1,065 ms 95,324 KB

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

ソースコード

raw source code

from sys import stdin
input=lambda :stdin.readline()[:-1]

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

inf=1<<30
S=SortedSet()
n,q=map(int,input().split())
for _ in range(q):
  query=list(map(int,input().split()))
  if query[0]==1:
    l,r=query[1:]
    L,R=l,r
    x=S.le([l,inf])
    if x!=None and x[0]<=l and r<=x[1]:
      continue
    if x!=None and l<=x[1]<=r:
      L=min(L,x[0])
    y=S.le([r,-inf])
    if y!=None and l<=y[0]<=r:
      R=max(R,y[1])
    while True:
      x=S.ge([L,L])
      if x!=None and L<=x[0]<=R:
        R=max(R,x[1])
        S.discard(x)
      else:
        break
    S.add([L,R])
    
  elif query[0]==2:
    l,r=query[1:]
    x=S.le([l-1,inf])
    if x!=None and x[1]>=l+1:
      S.discard(x)
      S.add([x[0],l])
      if x[1]>=r:
        S.add([r,x[1]])
    
    y=S.le([r,inf])
    if y!=None and y[1]>=r:
      S.discard(y)
      S.add([r,y[1]])
      if y[0]<=l:
        S.add([y[0],l])
    
    while True:
      x=S.ge([l,l])
      if x!=None and l<=x[0]<=x[1]<=r:
        S.discard(x)
      else:
        break
  
  elif query[0]==3:
    u,v=query[1:]
    u,v=min(u,v),max(u,v)
    if u==v:
      print(1)
      continue
    x=S.le([u,inf])
    if x!=None and x[0]<=u<=v<=x[1]:
      print(1)
    else:
      print(0)
  
  elif query[0]==4:
    u=query[1]
    x=S.le([u,inf])
    if x!=None and x[0]<=u<=x[1]:
      print(x[1]-x[0]+1)
    else:
      print(1)

yukicoder

結果

テストケース

ソースコード