結果
問題 | No.2292 Interval Union Find |
ユーザー |
![]() |
提出日時 | 2023-05-05 22:42:58 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 4,030 ms / 5,000 ms |
コード長 | 5,508 bytes |
コンパイル時間 | 1,331 ms |
コンパイル使用メモリ | 82,432 KB |
実行使用メモリ | 142,384 KB |
最終ジャッジ日時 | 2024-12-09 13:41:23 |
合計ジャッジ時間 | 106,540 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 44 |
ソースコード
from sys import stdininput=lambda :stdin.readline()[:-1]import mathfrom bisect import bisect_left, bisect_rightfrom typing import Generic, Iterable, Iterator, TypeVar, Union, ListT = TypeVar('T')class SortedSet(Generic[T]):BUCKET_RATIO = 50REBUILD_RATIO = 170def _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 jdef __reversed__(self) -> Iterator[T]:for i in reversed(self.a):for j in reversed(i): yield jdef __len__(self) -> int:return self.sizedef __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 areturn adef __contains__(self, x: T) -> bool:if self.size == 0: return Falsea = self._find_bucket(x)i = bisect_left(a, x)return i != len(a) and a[i] == xdef add(self, x: T) -> bool:"Add an element and return True if added. / O(√N)"if self.size == 0:self.a = [[x]]self.size = 1return Truea = self._find_bucket(x)i = bisect_left(a, x)if i != len(a) and a[i] == x: return Falsea.insert(i, x)self.size += 1if len(a) > len(self.a) * self.REBUILD_RATIO:self._build()return Truedef discard(self, x: T) -> bool:"Remove an element and return True if removed. / O(√N)"if self.size == 0: return Falsea = self._find_bucket(x)i = bisect_left(a, x)if i == len(a) or a[i] != x: return Falsea.pop(i)self.size -= 1if len(a) == 0: self._build()return Truedef 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.sizeif x < 0: raise IndexErrorfor a in self.a:if x < len(a): return a[x]x -= len(a)raise IndexErrordef index(self, x: T) -> int:"Count the number of elements < x."ans = 0for a in self.a:if a[-1] >= x:return ans + bisect_left(a, x)ans += len(a)return ansdef index_right(self, x: T) -> int:"Count the number of elements <= x."ans = 0for a in self.a:if a[-1] > x:return ans + bisect_right(a, x)ans += len(a)return ansinf=1<<30S=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,rx=S.le([l,inf])if x!=None and x[0]<=l and r<=x[1]:continueif 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:breakS.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:breakelif query[0]==3:u,v=query[1:]u,v=min(u,v),max(u,v)if u==v:print(1)continuex=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)