結果
| 問題 | No.2220 Range Insert & Point Mex |
| ユーザー |
👑 |
| 提出日時 | 2023-02-19 02:18:05 |
| 言語 | PyPy3 (7.3.15) |
| 結果 |
AC
|
| 実行時間 | 1,519 ms / 2,000 ms |
| コード長 | 4,867 bytes |
| コンパイル時間 | 293 ms |
| コンパイル使用メモリ | 87,088 KB |
| 実行使用メモリ | 160,568 KB |
| 最終ジャッジ日時 | 2023-09-28 18:22:22 |
| 合計ジャッジ時間 | 25,923 ms |
|
ジャッジサーバーID （参考情報） |
judge12 / judge11 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 257 ms
87,892 KB |
| testcase_01 | AC | 259 ms
88,108 KB |
| testcase_02 | AC | 257 ms
88,192 KB |
| testcase_03 | AC | 255 ms
87,184 KB |
| testcase_04 | AC | 258 ms
88,116 KB |
| testcase_05 | AC | 255 ms
87,836 KB |
| testcase_06 | AC | 257 ms
88,036 KB |
| testcase_07 | AC | 257 ms
87,328 KB |
| testcase_08 | AC | 258 ms
87,408 KB |
| testcase_09 | AC | 259 ms
87,568 KB |
| testcase_10 | AC | 258 ms
87,316 KB |
| testcase_11 | AC | 263 ms
88,416 KB |
| testcase_12 | AC | 259 ms
87,324 KB |
| testcase_13 | AC | 567 ms
113,520 KB |
| testcase_14 | AC | 563 ms
112,520 KB |
| testcase_15 | AC | 573 ms
113,332 KB |
| testcase_16 | AC | 567 ms
112,532 KB |
| testcase_17 | AC | 564 ms
112,420 KB |
| testcase_18 | AC | 557 ms
112,192 KB |
| testcase_19 | AC | 558 ms
113,620 KB |
| testcase_20 | AC | 1,498 ms
159,116 KB |
| testcase_21 | AC | 1,514 ms
159,312 KB |
| testcase_22 | AC | 1,519 ms
159,152 KB |
| testcase_23 | AC | 813 ms
160,568 KB |
| testcase_24 | AC | 782 ms
147,588 KB |
| testcase_25 | AC | 649 ms
143,016 KB |
| testcase_26 | AC | 789 ms
153,192 KB |
| testcase_27 | AC | 710 ms
138,912 KB |
| testcase_28 | AC | 318 ms
102,784 KB |
| testcase_29 | AC | 329 ms
107,928 KB |
| testcase_30 | AC | 329 ms
108,072 KB |
| testcase_31 | AC | 423 ms
112,524 KB |
| testcase_32 | AC | 579 ms
129,304 KB |
| testcase_33 | AC | 585 ms
130,120 KB |
| testcase_34 | AC | 1,063 ms
147,432 KB |
| testcase_35 | AC | 1,058 ms
147,124 KB |
| testcase_36 | AC | 887 ms
150,408 KB |
| testcase_37 | AC | 894 ms
148,584 KB |
| testcase_38 | AC | 747 ms
147,384 KB |
ソースコード
N=int(input())
A,C=[],[]
D={}
for i in range(N):
l,r,a=map(int,input().split())
if a not in D:
D[a]=[]
C.append(a)
D[a].append((l,r))
C=sorted(D)
for d in C:
B=sorted(D[d])
DD=[]
ll,rr=-1,-1
for l,r in B:
if rr<l:
if rr!=-1:
DD.append((ll,rr))
ll,rr=l,r
else:
rr=max(r,rr)
DD.append((ll,rr))
for l,r in DD:
A.append((l,0,d))
A.append((r,2,d))
M=int(input())
B=list(map(int, input().split()))
c=0
for b in B:
A.append((b,1,c))
c+=1
A=sorted(A)
import sys
input = sys.stdin.readlines
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
st = SortedMultiset()
for i in range(10**5+1):
st.add(i)
ans=[]
for a,b,c in A:
if b==0:
st.discard(c)
elif b==1:
ans.append(st[0])
else:
st.add(c)
for i in ans:
print(i)