結果
問題 | No.2220 Range Insert & Point Mex |
ユーザー | lloyz |
提出日時 | 2023-12-31 01:07:20 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 908 ms / 2,000 ms |
コード長 | 5,567 bytes |
コンパイル時間 | 273 ms |
コンパイル使用メモリ | 81,700 KB |
実行使用メモリ | 137,872 KB |
最終ジャッジ日時 | 2023-12-31 01:07:44 |
合計ジャッジ時間 | 22,027 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 61 ms
67,852 KB |
testcase_01 | AC | 59 ms
67,852 KB |
testcase_02 | AC | 60 ms
67,856 KB |
testcase_03 | AC | 64 ms
67,856 KB |
testcase_04 | AC | 59 ms
67,852 KB |
testcase_05 | AC | 61 ms
67,852 KB |
testcase_06 | AC | 60 ms
67,852 KB |
testcase_07 | AC | 63 ms
67,852 KB |
testcase_08 | AC | 61 ms
67,852 KB |
testcase_09 | AC | 61 ms
67,852 KB |
testcase_10 | AC | 66 ms
67,852 KB |
testcase_11 | AC | 59 ms
67,852 KB |
testcase_12 | AC | 60 ms
67,852 KB |
testcase_13 | AC | 899 ms
135,688 KB |
testcase_14 | AC | 865 ms
135,692 KB |
testcase_15 | AC | 875 ms
135,692 KB |
testcase_16 | AC | 857 ms
136,032 KB |
testcase_17 | AC | 835 ms
135,688 KB |
testcase_18 | AC | 880 ms
136,028 KB |
testcase_19 | AC | 865 ms
135,684 KB |
testcase_20 | AC | 826 ms
125,176 KB |
testcase_21 | AC | 853 ms
125,156 KB |
testcase_22 | AC | 837 ms
125,176 KB |
testcase_23 | AC | 526 ms
132,832 KB |
testcase_24 | AC | 523 ms
116,664 KB |
testcase_25 | AC | 348 ms
122,048 KB |
testcase_26 | AC | 505 ms
133,180 KB |
testcase_27 | AC | 467 ms
100,348 KB |
testcase_28 | AC | 139 ms
106,568 KB |
testcase_29 | AC | 140 ms
111,324 KB |
testcase_30 | AC | 141 ms
111,324 KB |
testcase_31 | AC | 365 ms
130,456 KB |
testcase_32 | AC | 385 ms
112,696 KB |
testcase_33 | AC | 364 ms
113,040 KB |
testcase_34 | AC | 890 ms
134,736 KB |
testcase_35 | AC | 881 ms
134,980 KB |
testcase_36 | AC | 876 ms
137,872 KB |
testcase_37 | AC | 908 ms
136,968 KB |
testcase_38 | AC | 450 ms
136,560 KB |
ソースコード
# https://github.com/tatyam-prime/SortedSet/blob/main/SortedSet.py import math from bisect import bisect_left, bisect_right from typing import Generic, Iterable, Iterator, List, Tuple, TypeVar, Optional T = TypeVar('T') class SortedSet(Generic[T]): BUCKET_RATIO = 16 SPLIT_RATIO = 24 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) n = self.size = len(a) if any(a[i] > a[i + 1] for i in range(n - 1)): a.sort() if any(a[i] >= a[i + 1] for i in range(n - 1)): a, b = [], a for x in b: if not a or a[-1] != x: a.append(x) bucket_size = int(math.ceil(math.sqrt(n / self.BUCKET_RATIO))) self.a = [a[n * i // bucket_size : n * (i + 1) // bucket_size] for i in range(bucket_size)] 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 __eq__(self, other) -> bool: return list(self) == list(other) 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 _position(self, x: T) -> Tuple[List[T], int, int]: "return the bucket, index of the bucket and position in which x should be. self must not be empty." for i, a in enumerate(self.a): if x <= a[-1]: break return (a, i, bisect_left(a, x)) def __contains__(self, x: T) -> bool: if self.size == 0: return False a, _, i = self._position(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, b, i = self._position(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.SPLIT_RATIO: mid = len(a) >> 1 self.a[b:b+1] = [a[:mid], a[mid:]] return True def _pop(self, a: List[T], b: int, i: int) -> T: ans = a.pop(i) self.size -= 1 if not a: del self.a[b] return ans def discard(self, x: T) -> bool: "Remove an element and return True if removed. / O(√N)" if self.size == 0: return False a, b, i = self._position(x) if i == len(a) or a[i] != x: return False self._pop(a, b, i) 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, i: int) -> T: "Return the i-th element." if i < 0: for a in reversed(self.a): i += len(a) if i >= 0: return a[i] else: for a in self.a: if i < len(a): return a[i] i -= len(a) raise IndexError def pop(self, i: int = -1) -> T: "Pop and return the i-th element." if i < 0: for b, a in enumerate(reversed(self.a)): i += len(a) if i >= 0: return self._pop(a, ~b, i) else: for b, a in enumerate(self.a): if i < len(a): return self._pop(a, b, i) i -= 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 = int(input()) L = [] for _ in range(n): l, r, a = map(int, input().split()) L.append((l, 1, a)) L.append((r, 3, a)) q = int(input()) X = list(map(int, input().split())) for i in range(q): L.append((X[i], 2, i)) L.sort() S = SortedSet(range(n + 1)) C = [0 for _ in range(n)] ANS = [0 for _ in range(q)] for idx, mode, num in L: if mode == 1: if num >= n: continue if C[num] == 0: S.discard(num) C[num] += 1 elif mode == 2: ANS[num] = S[0] else: if num >= n: continue C[num] -= 1 if C[num] == 0: S.add(num) print(*ANS, sep='\n')