#956242 (PyPy3) No.2292 Interval Union Find

提出ソース

結果

問題	No.2292 Interval Union Find
ユーザー	👑 timi
提出日時	2024-02-28 15:36:41
言語	PyPy3 (7.3.15)
結果	AC
実行時間	2,537 ms / 5,000 ms
コード長	5,750 bytes
コンパイル時間	406 ms
コンパイル使用メモリ	81,700 KB
実行使用メモリ	121,660 KB
最終ジャッジ日時	2024-02-28 15:38:11
合計ジャッジ時間	87,696 ms
ジャッジサーバーID （参考情報）	judge13 / judge15

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	62 ms 67,852 KB
testcase_01	AC	62 ms 67,852 KB
testcase_02	AC	62 ms 67,852 KB
testcase_03	AC	62 ms 67,852 KB
testcase_04	AC	1,613 ms 92,968 KB
testcase_05	AC	2,537 ms 110,736 KB
testcase_06	AC	1,808 ms 96,904 KB
testcase_07	AC	2,500 ms 112,736 KB
testcase_08	AC	1,675 ms 91,828 KB
testcase_09	AC	1,902 ms 99,404 KB
testcase_10	AC	1,605 ms 93,792 KB
testcase_11	AC	1,639 ms 92,144 KB
testcase_12	AC	2,091 ms 104,276 KB
testcase_13	AC	1,413 ms 92,020 KB
testcase_14	AC	1,793 ms 95,736 KB
testcase_15	AC	1,930 ms 96,888 KB
testcase_16	AC	1,424 ms 89,772 KB
testcase_17	AC	1,310 ms 87,348 KB
testcase_18	AC	1,017 ms 117,472 KB
testcase_19	AC	1,140 ms 100,780 KB
testcase_20	AC	1,367 ms 121,660 KB
testcase_21	AC	1,973 ms 113,528 KB
testcase_22	AC	1,595 ms 104,300 KB
testcase_23	AC	1,911 ms 111,276 KB
testcase_24	AC	1,966 ms 111,824 KB
testcase_25	AC	1,895 ms 109,852 KB
testcase_26	AC	1,890 ms 108,688 KB
testcase_27	AC	1,942 ms 111,724 KB
testcase_28	AC	1,927 ms 108,648 KB
testcase_29	AC	1,938 ms 110,004 KB
testcase_30	AC	1,967 ms 111,956 KB
testcase_31	AC	1,872 ms 109,596 KB
testcase_32	AC	1,917 ms 109,892 KB
testcase_33	AC	1,910 ms 110,712 KB
testcase_34	AC	1,916 ms 110,020 KB
testcase_35	AC	1,914 ms 109,720 KB
testcase_36	AC	1,969 ms 110,864 KB
testcase_37	AC	1,576 ms 100,884 KB
testcase_38	AC	1,683 ms 104,172 KB
testcase_39	AC	1,877 ms 107,312 KB
testcase_40	AC	1,893 ms 113,024 KB
testcase_41	AC	754 ms 84,348 KB
testcase_42	AC	1,600 ms 92,284 KB
testcase_43	AC	2,088 ms 100,564 KB
testcase_44	AC	2,039 ms 100,544 KB
testcase_45	AC	1,593 ms 92,720 KB
testcase_46	AC	2,228 ms 101,084 KB
testcase_47	AC	2,006 ms 99,908 KB

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

ソースコード

raw source code

N,Q=map(int, input().split())
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

st = SortedMultiset()
st.add((-100,-100))
st.add((10**10,10**10))

for i in range(Q):
  t,*A=list(map(int, input().split()))
  if t==1:
    p,q=A
    st.add((p,q))
    d=st.index((p,q))
    while st[d][1]>=st[d+1][1]:
      l,r=st[d+1]
      st.discard((l,r))
    if st[d][1]>=st[d+1][0]:
      ll,rr=min(st[d][0],st[d+1][0]),max(st[d][1],st[d+1][1])
      l,r=st[d]
      st.discard((l,r))
      l,r=st[d]
      st.discard((l,r))
      st.add((ll,rr))
    while st[d-1][0]>=st[d][0]:
      l,r=st[d-1]
      st.discard((l,r))
      d-=1
    if st[d-1][1]>=st[d][0]:
      ll,rr=min(st[d-1][0],st[d][0]),max(st[d-1][1],st[d][1])
      l,r=st[d]
      st.discard((l,r))
      d-=1
      l,r=st[d]
      st.discard((l,r))
      st.add((ll,rr))
  elif t==2:
    p,q=A
    d=st.index((p,q))
    l,r=st[d-1]
    if l<=p and q<=r:
      st.discard((l,r))
      st.add((l,p))
      st.add((q,r))
    else:
      while q>=st[d][1]:
        l,r=st[d]
        st.discard((l,r))
      if st[d][0]<=q:
        l,r=st[d]
        st.discard((l,r))
        st.add((q,r))
      while p<=st[d-1][0]:
        l,r=st[d-1]
        st.discard((l,r))
        d-=1
    if p<=st[d-1][1]:
      l,r=st[d-1]
      st.discard((l,r))
      st.add((l,p))
  elif t==3:
    p,q=A
    if p==q:
      print(1)
    else:
      d=st.index((p,10**10))
      l,r=st[d-1]
      if p>q:
        p,q=q,p
      #print(l,r,'!')
      if l<=p and q<=r:
        print(1)
      else:
        print(0)
  else:
    p=A[0]
    d=st.index((p,10**10))
    l,r=st[d-1]
    if l<=p<=r:
      print(r-l+1)
    else:
      print(1)
  # if t<=2:
  #   print(st)

yukicoder

結果

テストケース

ソースコード