結果
問題 | No.2292 Interval Union Find |
ユーザー | とりゐ |
提出日時 | 2023-05-05 22:19:29 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 5,495 bytes |
コンパイル時間 | 314 ms |
コンパイル使用メモリ | 82,304 KB |
実行使用メモリ | 142,660 KB |
最終ジャッジ日時 | 2024-05-02 16:59:47 |
合計ジャッジ時間 | 102,167 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 76 ms
67,712 KB |
testcase_01 | AC | 74 ms
67,712 KB |
testcase_02 | AC | 78 ms
67,840 KB |
testcase_03 | AC | 75 ms
67,712 KB |
testcase_04 | AC | 1,126 ms
96,352 KB |
testcase_05 | WA | - |
testcase_06 | AC | 955 ms
92,588 KB |
testcase_07 | WA | - |
testcase_08 | AC | 1,236 ms
92,048 KB |
testcase_09 | AC | 1,255 ms
93,956 KB |
testcase_10 | AC | 1,166 ms
95,564 KB |
testcase_11 | AC | 937 ms
88,632 KB |
testcase_12 | AC | 1,752 ms
100,588 KB |
testcase_13 | AC | 978 ms
94,548 KB |
testcase_14 | AC | 1,051 ms
93,808 KB |
testcase_15 | AC | 1,023 ms
91,520 KB |
testcase_16 | AC | 1,096 ms
92,280 KB |
testcase_17 | AC | 1,123 ms
90,088 KB |
testcase_18 | AC | 2,649 ms
127,020 KB |
testcase_19 | AC | 3,355 ms
110,996 KB |
testcase_20 | AC | 4,109 ms
142,660 KB |
testcase_21 | WA | - |
testcase_22 | AC | 3,251 ms
110,620 KB |
testcase_23 | AC | 3,182 ms
111,720 KB |
testcase_24 | AC | 3,108 ms
108,688 KB |
testcase_25 | AC | 3,140 ms
108,200 KB |
testcase_26 | AC | 3,179 ms
109,588 KB |
testcase_27 | AC | 3,130 ms
110,396 KB |
testcase_28 | AC | 3,161 ms
113,752 KB |
testcase_29 | AC | 3,125 ms
109,424 KB |
testcase_30 | AC | 3,091 ms
109,568 KB |
testcase_31 | AC | 3,123 ms
108,500 KB |
testcase_32 | AC | 3,142 ms
109,348 KB |
testcase_33 | AC | 3,063 ms
110,468 KB |
testcase_34 | AC | 3,383 ms
107,740 KB |
testcase_35 | AC | 3,158 ms
110,792 KB |
testcase_36 | AC | 3,030 ms
107,964 KB |
testcase_37 | AC | 3,127 ms
109,024 KB |
testcase_38 | AC | 3,007 ms
110,324 KB |
testcase_39 | AC | 3,005 ms
109,976 KB |
testcase_40 | AC | 3,151 ms
108,912 KB |
testcase_41 | AC | 407 ms
83,632 KB |
testcase_42 | WA | - |
testcase_43 | WA | - |
testcase_44 | WA | - |
testcase_45 | WA | - |
testcase_46 | WA | - |
testcase_47 | WA | - |
ソースコード
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] and x[1]<=R: 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)