結果
問題 | No.2421 entersys? |
ユーザー | 👑 H20 |
提出日時 | 2023-08-12 14:34:03 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,393 ms / 3,000 ms |
コード長 | 5,700 bytes |
コンパイル時間 | 285 ms |
コンパイル使用メモリ | 82,596 KB |
実行使用メモリ | 230,628 KB |
最終ジャッジ日時 | 2024-04-30 06:29:39 |
合計ジャッジ時間 | 24,196 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 56 ms
68,528 KB |
testcase_01 | AC | 79 ms
77,428 KB |
testcase_02 | AC | 113 ms
78,800 KB |
testcase_03 | AC | 61 ms
72,084 KB |
testcase_04 | AC | 82 ms
77,940 KB |
testcase_05 | AC | 101 ms
77,956 KB |
testcase_06 | AC | 98 ms
78,544 KB |
testcase_07 | AC | 99 ms
78,440 KB |
testcase_08 | AC | 106 ms
79,156 KB |
testcase_09 | AC | 128 ms
80,028 KB |
testcase_10 | AC | 93 ms
78,020 KB |
testcase_11 | AC | 1,197 ms
181,448 KB |
testcase_12 | AC | 1,216 ms
182,508 KB |
testcase_13 | AC | 1,196 ms
180,416 KB |
testcase_14 | AC | 1,225 ms
180,596 KB |
testcase_15 | AC | 1,224 ms
180,772 KB |
testcase_16 | AC | 1,256 ms
204,192 KB |
testcase_17 | AC | 1,295 ms
205,488 KB |
testcase_18 | AC | 1,242 ms
204,984 KB |
testcase_19 | AC | 1,263 ms
205,272 KB |
testcase_20 | AC | 1,266 ms
203,760 KB |
testcase_21 | AC | 983 ms
193,144 KB |
testcase_22 | AC | 911 ms
175,220 KB |
testcase_23 | AC | 1,333 ms
228,392 KB |
testcase_24 | AC | 1,393 ms
230,628 KB |
testcase_25 | AC | 1,349 ms
228,412 KB |
testcase_26 | AC | 780 ms
152,092 KB |
testcase_27 | AC | 769 ms
151,464 KB |
testcase_28 | AC | 770 ms
151,624 KB |
ソースコード
import collections # https://github.com/tatyam-prime/SortedSet/blob/main/SortedMultiset.py import math from bisect import bisect_left, bisect_right from typing import Generic, Iterable, Iterator, List, Tuple, TypeVar, Optional T = TypeVar('T') class SortedMultiset(Generic[T]): BUCKET_RATIO = 50 REBUILD_RATIO = 170 def _build(self, a: Optional[List[T]] = None) -> None: "Evenly divide `a` into buckets." if a is None: a = list(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) self.size = len(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 __eq__(self, other) -> bool: return list(self) == list(other) 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 _position(self, x: T) -> Tuple[List[T], int]: "Find the bucket and position which x should be inserted. self must not be empty." for a in self.a: if x <= a[-1]: break return (a, 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 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, i = self._position(x) a.insert(i, x) self.size += 1 if len(a) > len(self.a) * self.REBUILD_RATIO: self._build() def _pop(self, a: List[T], i: int) -> T: ans = a.pop(i) self.size -= 1 if not a: self._build() 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, i = self._position(x) if i == len(a) or a[i] != x: return False self._pop(a, 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 a in reversed(self.a): i += len(a) if i >= 0: return self._pop(a, i) else: for a in self.a: if i < len(a): return self._pop(a, 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()) XLR = [list(input().split()) for _ in range(N)] q = int(input()) Q = [list(input().split()) for _ in range(q)] ALL_IN = SortedMultiset() PERSON_IN = collections.defaultdict(SortedMultiset) ALL_OUT = SortedMultiset() PERSON_OUT = collections.defaultdict(SortedMultiset) for x,L,R in XLR: L,R = int(L),int(R) ALL_IN.add(L) ALL_OUT.add(R) PERSON_IN[x].add(L) PERSON_OUT[x].add(R) for q in Q: if q[0]=='1': x,t = q[1],int(q[2]) if PERSON_IN[x].index_right(t)!=PERSON_OUT[x].index_right(t-1): print('Yes') else: print('No') elif q[0]=='2': t = int(q[1]) print(ALL_IN.index_right(t)-ALL_OUT.index_right(t-1)) else: x,L,R = q[1],int(q[2]),int(q[3]) ALL_IN.add(L) ALL_OUT.add(R) PERSON_IN[x].add(L) PERSON_OUT[x].add(R)