結果
| 問題 | No.2220 Range Insert & Point Mex |
| ユーザー |
 ニックネーム
|
| 提出日時 | 2023-02-17 23:03:51 |
| 言語 | PyPy3 (7.3.15) |
| 結果 |
AC
|
| 実行時間 | 819 ms / 2,000 ms |
| コード長 | 4,873 bytes |
| コンパイル時間 | 847 ms |
| コンパイル使用メモリ | 86,900 KB |
| 実行使用メモリ | 133,360 KB |
| 最終ジャッジ日時 | 2023-09-28 18:14:16 |
| 合計ジャッジ時間 | 21,314 ms |
|
ジャッジサーバーID （参考情報） |
judge12 / judge13 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 177 ms
80,348 KB |
| testcase_01 | AC | 181 ms
80,360 KB |
| testcase_02 | AC | 175 ms
80,500 KB |
| testcase_03 | AC | 177 ms
80,344 KB |
| testcase_04 | AC | 176 ms
80,256 KB |
| testcase_05 | AC | 177 ms
80,564 KB |
| testcase_06 | AC | 179 ms
80,180 KB |
| testcase_07 | AC | 177 ms
80,188 KB |
| testcase_08 | AC | 178 ms
80,548 KB |
| testcase_09 | AC | 177 ms
80,200 KB |
| testcase_10 | AC | 177 ms
80,512 KB |
| testcase_11 | AC | 179 ms
80,444 KB |
| testcase_12 | AC | 178 ms
80,532 KB |
| testcase_13 | AC | 728 ms
129,652 KB |
| testcase_14 | AC | 709 ms
129,588 KB |
| testcase_15 | AC | 710 ms
129,540 KB |
| testcase_16 | AC | 715 ms
129,716 KB |
| testcase_17 | AC | 725 ms
129,356 KB |
| testcase_18 | AC | 710 ms
129,560 KB |
| testcase_19 | AC | 708 ms
129,628 KB |
| testcase_20 | AC | 529 ms
125,668 KB |
| testcase_21 | AC | 528 ms
125,460 KB |
| testcase_22 | AC | 528 ms
125,620 KB |
| testcase_23 | AC | 570 ms
133,356 KB |
| testcase_24 | AC | 513 ms
116,544 KB |
| testcase_25 | AC | 564 ms
124,756 KB |
| testcase_26 | AC | 562 ms
133,360 KB |
| testcase_27 | AC | 368 ms
101,208 KB |
| testcase_28 | AC | 376 ms
114,836 KB |
| testcase_29 | AC | 379 ms
117,060 KB |
| testcase_30 | AC | 380 ms
116,904 KB |
| testcase_31 | AC | 556 ms
132,256 KB |
| testcase_32 | AC | 515 ms
121,192 KB |
| testcase_33 | AC | 645 ms
121,360 KB |
| testcase_34 | AC | 659 ms
128,060 KB |
| testcase_35 | AC | 776 ms
127,784 KB |
| testcase_36 | AC | 652 ms
127,316 KB |
| testcase_37 | AC | 764 ms
127,548 KB |
| testcase_38 | AC | 819 ms
131,568 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, 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 = int(input())
alr = [[(0,0),(10**9+1,10**9+1)] for _ in range(n+1)]
for _ in range(n):
l,r,a = map(int,input().split())
if a<=n: alr[a].append((l,r))
ans = [0]*int(input())
x = list(map(int,input().split()))
d = {v:i for i,v in enumerate(x)}
ss = SortedSet(x)
for a in range(n+1):
lr = []
for l,r in sorted(alr[a]):
if not lr or lr[-1][1]+1<l: lr.append([l,r])
else: lr[-1][1] = max(lr[-1][1],r)
for (_,r),(l,_) in zip(lr[:-1],lr[1:]):
jl = ss.index_right(r)
jr = ss.index(l)-1
for j in range(jr,jl-1,-1):
v = ss[j]
ss.discard(v)
ans[d[v]] = a
print(*ans,sep="\n")