結果
問題 | No.2292 Interval Union Find |
ユーザー | t98slider |
提出日時 | 2023-03-30 02:09:49 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
AC
|
実行時間 | 3,457 ms / 5,000 ms |
コード長 | 5,581 bytes |
コンパイル時間 | 552 ms |
コンパイル使用メモリ | 12,528 KB |
実行使用メモリ | 25,640 KB |
最終ジャッジ日時 | 2023-10-22 01:11:26 |
合計ジャッジ時間 | 61,792 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 40 ms
11,304 KB |
testcase_01 | AC | 39 ms
11,304 KB |
testcase_02 | AC | 39 ms
11,304 KB |
testcase_03 | AC | 38 ms
11,304 KB |
testcase_04 | AC | 867 ms
11,616 KB |
testcase_05 | AC | 1,072 ms
11,716 KB |
testcase_06 | AC | 918 ms
11,572 KB |
testcase_07 | AC | 1,107 ms
11,660 KB |
testcase_08 | AC | 959 ms
11,572 KB |
testcase_09 | AC | 956 ms
11,564 KB |
testcase_10 | AC | 912 ms
11,544 KB |
testcase_11 | AC | 912 ms
11,536 KB |
testcase_12 | AC | 1,018 ms
11,604 KB |
testcase_13 | AC | 864 ms
11,544 KB |
testcase_14 | AC | 894 ms
11,552 KB |
testcase_15 | AC | 985 ms
11,512 KB |
testcase_16 | AC | 966 ms
11,512 KB |
testcase_17 | AC | 1,079 ms
11,500 KB |
testcase_18 | AC | 2,067 ms
24,940 KB |
testcase_19 | AC | 1,539 ms
22,516 KB |
testcase_20 | AC | 3,457 ms
25,640 KB |
testcase_21 | AC | 1,572 ms
19,312 KB |
testcase_22 | AC | 1,569 ms
19,348 KB |
testcase_23 | AC | 1,547 ms
19,380 KB |
testcase_24 | AC | 1,562 ms
19,112 KB |
testcase_25 | AC | 1,574 ms
19,248 KB |
testcase_26 | AC | 1,588 ms
19,340 KB |
testcase_27 | AC | 1,579 ms
19,348 KB |
testcase_28 | AC | 1,566 ms
19,524 KB |
testcase_29 | AC | 1,581 ms
19,400 KB |
testcase_30 | AC | 1,567 ms
19,544 KB |
testcase_31 | AC | 1,568 ms
19,368 KB |
testcase_32 | AC | 1,559 ms
19,300 KB |
testcase_33 | AC | 1,573 ms
19,404 KB |
testcase_34 | AC | 1,601 ms
19,324 KB |
testcase_35 | AC | 1,598 ms
19,344 KB |
testcase_36 | AC | 1,584 ms
19,332 KB |
testcase_37 | AC | 1,573 ms
19,260 KB |
testcase_38 | AC | 1,583 ms
19,524 KB |
testcase_39 | AC | 1,594 ms
19,400 KB |
testcase_40 | AC | 1,584 ms
19,268 KB |
testcase_41 | AC | 637 ms
11,676 KB |
testcase_42 | AC | 679 ms
11,692 KB |
testcase_43 | AC | 717 ms
11,692 KB |
testcase_44 | AC | 798 ms
11,636 KB |
testcase_45 | AC | 804 ms
11,644 KB |
testcase_46 | AC | 827 ms
11,648 KB |
testcase_47 | AC | 1,003 ms
11,576 KB |
ソースコード
# 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(1 if u == v else 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)