結果
| 問題 |
No.2404 Vertical Throw Up
|
| コンテスト | |
| ユーザー |
|
| 提出日時 | 2023-07-13 23:57:46 |
| 言語 | PyPy3 (7.3.15) |
| 結果 |
AC
|
| 実行時間 | 520 ms / 2,000 ms |
| コード長 | 6,892 bytes |
| コンパイル時間 | 208 ms |
| コンパイル使用メモリ | 82,048 KB |
| 実行使用メモリ | 82,788 KB |
| 最終ジャッジ日時 | 2024-09-15 09:22:01 |
| 合計ジャッジ時間 | 7,429 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 30 |
ソースコード
# 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, List, Tuple, TypeVar, Optional
T = TypeVar('T')
class SortedSet(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 SortedSet from iterable. / O(N) if sorted and unique / 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(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 __eq__(self, other) -> bool:
return list(self) == list(other)
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 _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 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, i = self._position(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 _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
# SortedSet up to here
class cht():
__as=SortedSet([-1,5*10**10])
__bs={-1:-2*10**18, 5*10**10:-9*10**18}
def __tmax(self, a1:int, b1:int, a2:int, b2:int) -> int:
assert a1<a2
return (b1-b2)//(a2-a1)
def __need(self, a1:int, b1:int, a2:int, b2:int, a3:int, b3:int) -> bool:
assert a1<a2 and a2<a3
return self.__tmax(a1,b1,a2,b2)<self.__tmax(a2,b2,a3,b3)
def __h(self, t:int, index:int) -> int:
return self.__as[index]*t+self.__bs[self.__as[index]]
def add(self, a:int, b:int) -> None:
if a in self.__as:
if self.__bs[a]>b:
return
else:
self.__bs.pop(a)
self.__as.discard(a)
next=self.__as.gt(a)
prev=self.__as.lt(a)
if not self.__need(prev,self.__bs[prev],a,b,next,self.__bs[next]):
return
self.__as.add(a)
self.__bs[a]=b
index=self.__as.index(a)
if index+2<len(self.__as):
while not self.__need(self.__as[index],self.__bs[self.__as[index]],self.__as[index+1],self.__bs[self.__as[index+1]],self.__as[index+2],self.__bs[self.__as[index+2]]):
self.__bs.pop(self.__as[index+1])
self.__as.pop(index+1)
if index+2>=len(self.__as):
break
if index-2>=0:
while not self.__need(self.__as[index-2],self.__bs[self.__as[index-2]],self.__as[index-1],self.__bs[self.__as[index-1]],self.__as[index],self.__bs[self.__as[index]]):
self.__bs.pop(self.__as[index-1])
self.__as.pop(index-1)
index-=1
if index-2<0:
break
def max(self, t:int) -> int:
while(self.__h(t,1)<self.__h(t,2)):
self.__bs.pop(self.__as[1])
self.__as.pop(1)
return self.__h(t,1)
a=int(input())
q=int(input())
l=cht()
for _ in range(q):
query=input()
if query[0]=="1":
_,s,t=map(int,query.split())
l.add(a*(s+t),-a*s*t)
else:
_,t=map(int,query.split())
lmax=l.max(t)
print(max(lmax-a*t*t,0))