結果
| 問題 | No.2220 Range Insert & Point Mex |
| ユーザー |
 chankei271828
|
| 提出日時 | 2023-02-18 00:11:36 |
| 言語 | PyPy3 (7.3.15) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 5,557 bytes |
| コンパイル時間 | 1,626 ms |
| コンパイル使用メモリ | 86,636 KB |
| 実行使用メモリ | 140,776 KB |
| 最終ジャッジ日時 | 2023-09-26 21:26:02 |
| 合計ジャッジ時間 | 37,240 ms |
|
ジャッジサーバーID （参考情報） |
judge15 / judge12 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 166 ms
80,356 KB |
| testcase_01 | AC | 166 ms
80,268 KB |
| testcase_02 | AC | 167 ms
80,292 KB |
| testcase_03 | WA | - |
| testcase_04 | AC | 166 ms
80,360 KB |
| testcase_05 | WA | - |
| testcase_06 | WA | - |
| testcase_07 | WA | - |
| testcase_08 | WA | - |
| testcase_09 | WA | - |
| testcase_10 | WA | - |
| testcase_11 | AC | 166 ms
80,340 KB |
| testcase_12 | WA | - |
| testcase_13 | WA | - |
| testcase_14 | WA | - |
| testcase_15 | WA | - |
| testcase_16 | WA | - |
| testcase_17 | WA | - |
| testcase_18 | WA | - |
| testcase_19 | WA | - |
| testcase_20 | AC | 1,810 ms
138,552 KB |
| testcase_21 | AC | 1,847 ms
138,340 KB |
| testcase_22 | AC | 1,851 ms
140,776 KB |
| testcase_23 | AC | 726 ms
135,812 KB |
| testcase_24 | AC | 699 ms
120,156 KB |
| testcase_25 | AC | 529 ms
119,788 KB |
| testcase_26 | AC | 712 ms
133,488 KB |
| testcase_27 | AC | 629 ms
105,416 KB |
| testcase_28 | AC | 255 ms
110,664 KB |
| testcase_29 | AC | 259 ms
112,092 KB |
| testcase_30 | AC | 261 ms
111,372 KB |
| testcase_31 | AC | 535 ms
131,796 KB |
| testcase_32 | AC | 660 ms
125,404 KB |
| testcase_33 | AC | 645 ms
126,696 KB |
| testcase_34 | AC | 1,680 ms
136,240 KB |
| testcase_35 | AC | 1,632 ms
136,272 KB |
| testcase_36 | AC | 1,572 ms
136,604 KB |
| testcase_37 | AC | 1,606 ms
136,596 KB |
| testcase_38 | AC | 715 ms
135,604 KB |
ソースコード
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
N=int(input())
event=[]
for _ in range(N):
l,r,a=map(int,input().split())
event.append((l,0,a))
event.append((r+1,-1,a))
Q=int(input())
x=list(map(int,input().split()))
for t in x:
event.append((t,1,0))
event.sort()
SM=SortedMultiset()
ans=[]
n=len(event)
SM.add((-10**20,-10**20))
SM.add((10**20,10**20))
for i in range(n):
s,m,a=event[i]
if m==1:#検査
l,r=SM.lt((1,2))
if l==0:
ans.append(r)
else:
ans.append(0)
if m==0:#aを追加
l,r=SM.lt((a+1,a+2))
if not(l<=a<r):#aが入っていない
l0,r0=SM.lt((a,a+1))
l1,r1=SM.gt((a,a+1))
if r0==a and l1==a+1:
SM.discard((l0,r0))
SM.discard((l1,r1))
SM.add((l0,r1))
elif r0==a:
SM.discard((l0,r0))
SM.add((l0,a+1))
elif l1==a+1:
SM.discard((l1,r1))
SM.add((a,r1))
else:
SM.add((a,a+1))
if m==-1:#削除
l,r=SM.lt((a+1,a+2))
if l<=a<r:
if l==a:
SM.discard((l,r))
SM.add((a+1,r))
elif r==a+1:
SM.discard((l,r))
SM.add((l,r-1))
else:
SM.discard((l,r))
SM.add((l,a))
SM.add((a+1,r))
for t in ans:
print(t)