結果
| 問題 | No.2421 entersys? |
| ユーザー |
 isee
|
| 提出日時 | 2023-08-12 14:58:31 |
| 言語 | PyPy3 (7.3.15) |
| 結果 |
AC
|
| 実行時間 | 1,744 ms / 3,000 ms |
| コード長 | 9,929 bytes |
| コンパイル時間 | 175 ms |
| コンパイル使用メモリ | 82,192 KB |
| 実行使用メモリ | 191,016 KB |
| 最終ジャッジ日時 | 2024-11-19 22:27:35 |
| 合計ジャッジ時間 | 28,484 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge2 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 67 ms
69,760 KB |
| testcase_01 | AC | 90 ms
77,320 KB |
| testcase_02 | AC | 118 ms
78,628 KB |
| testcase_03 | AC | 75 ms
72,972 KB |
| testcase_04 | AC | 91 ms
77,756 KB |
| testcase_05 | AC | 100 ms
77,652 KB |
| testcase_06 | AC | 102 ms
77,452 KB |
| testcase_07 | AC | 101 ms
77,504 KB |
| testcase_08 | AC | 108 ms
78,280 KB |
| testcase_09 | AC | 133 ms
78,652 KB |
| testcase_10 | AC | 96 ms
77,476 KB |
| testcase_11 | AC | 1,493 ms
143,100 KB |
| testcase_12 | AC | 1,511 ms
144,320 KB |
| testcase_13 | AC | 1,536 ms
144,304 KB |
| testcase_14 | AC | 1,502 ms
144,384 KB |
| testcase_15 | AC | 1,544 ms
144,504 KB |
| testcase_16 | AC | 1,539 ms
163,128 KB |
| testcase_17 | AC | 1,543 ms
166,460 KB |
| testcase_18 | AC | 1,557 ms
165,280 KB |
| testcase_19 | AC | 1,542 ms
162,392 KB |
| testcase_20 | AC | 1,561 ms
165,944 KB |
| testcase_21 | AC | 1,136 ms
144,048 KB |
| testcase_22 | AC | 1,087 ms
143,120 KB |
| testcase_23 | AC | 1,703 ms
188,512 KB |
| testcase_24 | AC | 1,697 ms
191,016 KB |
| testcase_25 | AC | 1,744 ms
189,568 KB |
| testcase_26 | AC | 847 ms
113,568 KB |
| testcase_27 | AC | 825 ms
114,412 KB |
| testcase_28 | AC | 850 ms
113,480 KB |
ソースコード
import sys
input = lambda: sys.stdin.readline().rstrip()
# 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, 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
# https://github.com/tatyam-prime/SortedSet/blob/main/SortedMultiset.py
import math
from bisect import bisect_left, bisect_right, insort
from typing import Generic, Iterable, Iterator, TypeVar, Union, List
T = TypeVar('T')
class SortedMultiset(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 SortedMultiset from iterable. / O(N) if sorted / O(N log N)"
a = list(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 __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 _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 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 = self._find_bucket(x)
insort(a, x)
self.size += 1
if len(a) > len(self.a) * self.REBUILD_RATIO:
self._build()
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
def main():
# 入力
N = int(input())
allenterinfo = SortedMultiset()
allexitinfo = SortedMultiset()
enterinfo = dict()
exitinfo = dict()
for _ in range(N):
X, L, R = input().split()
L, R = int(L), int(R)+1
if X not in enterinfo:
enterinfo[X] = SortedSet()
exitinfo[X] = SortedSet()
enterinfo[X].add(L)
exitinfo[X] .add(R)
allenterinfo.add(L)
allexitinfo .add(R)
Q = int(input())
for _ in range(Q):
# 計算・出力
q = input().split()
if q[0] == '1':
# 1 x t
x, t = q[1], int(q[2])
if x not in enterinfo:
print('No')
continue
entercount = enterinfo[x].index_right(t)
exitcount = exitinfo[x] .index_right(t)
print('Yes' if entercount > exitcount else 'No')
elif q[0] == '2':
# 2 t
t = int(q[1])
entercount = allenterinfo.index_right(t)
exitcount = allexitinfo .index_right(t)
print(entercount - exitcount)
else:
# 3 x l r
X, L, R = q[1], int(q[2]), int(q[3])+1
if X not in enterinfo:
enterinfo[X] = SortedSet()
exitinfo[X] = SortedSet()
enterinfo[X].add(L)
exitinfo[X] .add(R)
allenterinfo.add(L)
allexitinfo .add(R)
if __name__ == "__main__":
main()