結果
問題 | No.2693 Sword |
ユーザー | hibit_at |
提出日時 | 2024-02-08 22:49:03 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 9,294 bytes |
コンパイル時間 | 212 ms |
コンパイル使用メモリ | 81,980 KB |
実行使用メモリ | 78,648 KB |
最終ジャッジ日時 | 2024-09-28 13:00:13 |
合計ジャッジ時間 | 3,585 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 65 ms
68,900 KB |
testcase_01 | AC | 61 ms
69,040 KB |
testcase_02 | AC | 60 ms
69,636 KB |
testcase_03 | AC | 59 ms
69,884 KB |
testcase_04 | AC | 59 ms
69,464 KB |
testcase_05 | AC | 58 ms
68,908 KB |
testcase_06 | AC | 61 ms
69,068 KB |
testcase_07 | AC | 61 ms
69,620 KB |
testcase_08 | AC | 60 ms
68,668 KB |
testcase_09 | AC | 90 ms
77,736 KB |
testcase_10 | AC | 62 ms
69,888 KB |
testcase_11 | AC | 82 ms
77,392 KB |
testcase_12 | AC | 59 ms
69,904 KB |
testcase_13 | AC | 68 ms
74,040 KB |
testcase_14 | AC | 64 ms
69,952 KB |
testcase_15 | AC | 94 ms
78,440 KB |
testcase_16 | AC | 100 ms
78,648 KB |
testcase_17 | AC | 106 ms
78,424 KB |
testcase_18 | AC | 97 ms
78,384 KB |
testcase_19 | WA | - |
testcase_20 | AC | 90 ms
78,004 KB |
testcase_21 | AC | 99 ms
78,096 KB |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | AC | 61 ms
69,140 KB |
testcase_25 | AC | 60 ms
68,416 KB |
testcase_26 | AC | 62 ms
69,420 KB |
testcase_27 | AC | 60 ms
69,892 KB |
testcase_28 | AC | 62 ms
69,284 KB |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | AC | 85 ms
78,016 KB |
ソースコード
# https://github.com/tatyam-prime/SortedSet/blob/main/SortedMultiset.pyimport mathfrom bisect import bisect_left, bisect_right, insortfrom typing import Generic, Iterable, Iterator, TypeVar, Union, ListT = TypeVar("T")class SortedMultiset(Generic[T]):BUCKET_RATIO = 50REBUILD_RATIO = 170def _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 jdef __reversed__(self) -> Iterator[T]:for i in reversed(self.a):for j in reversed(i):yield jdef __len__(self) -> int:return self.sizedef __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 areturn adef __contains__(self, x: T) -> bool:if self.size == 0:return Falsea = self._find_bucket(x)i = bisect_left(a, x)return i != len(a) and a[i] == xdef 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 = 1returna = self._find_bucket(x)insort(a, x)self.size += 1if 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 Falsea = self._find_bucket(x)i = bisect_left(a, x)if i == len(a) or a[i] != x:return Falsea.pop(i)self.size -= 1if len(a) == 0:self._build()return Truedef 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.sizeif x < 0:raise IndexErrorfor a in self.a:if x < len(a):return a[x]x -= len(a)raise IndexErrordef index(self, x: T) -> int:"Count the number of elements < x."ans = 0for a in self.a:if a[-1] >= x:return ans + bisect_left(a, x)ans += len(a)return ansdef index_right(self, x: T) -> int:"Count the number of elements <= x."ans = 0for a in self.a:if a[-1] > x:return ans + bisect_right(a, x)ans += len(a)return ansclass SortedSet(Generic[T]):BUCKET_RATIO = 50REBUILD_RATIO = 170def _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 jdef __reversed__(self) -> Iterator[T]:for i in reversed(self.a):for j in reversed(i):yield jdef __len__(self) -> int:return self.sizedef __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 areturn adef __contains__(self, x: T) -> bool:if self.size == 0:return Falsea = self._find_bucket(x)i = bisect_left(a, x)return i != len(a) and a[i] == xdef add(self, x: T) -> bool:"Add an element and return True if added. / O(√N)"if self.size == 0:self.a = [[x]]self.size = 1return Truea = self._find_bucket(x)i = bisect_left(a, x)if i != len(a) and a[i] == x:return Falsea.insert(i, x)self.size += 1if len(a) > len(self.a) * self.REBUILD_RATIO:self._build()return Truedef discard(self, x: T) -> bool:"Remove an element and return True if removed. / O(√N)"if self.size == 0:return Falsea = self._find_bucket(x)i = bisect_left(a, x)if i == len(a) or a[i] != x:return Falsea.pop(i)self.size -= 1if len(a) == 0:self._build()return Truedef 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.sizeif x < 0:raise IndexErrorfor a in self.a:if x < len(a):return a[x]x -= len(a)raise IndexErrordef index(self, x: T) -> int:"Count the number of elements < x."ans = 0for a in self.a:if a[-1] >= x:return ans + bisect_left(a, x)ans += len(a)return ansdef index_right(self, x: T) -> int:"Count the number of elements <= x."ans = 0for a in self.a:if a[-1] > x:return ans + bisect_right(a, x)ans += len(a)return ansn, p, k = list(map(int, input().split(" ")))st = SortedMultiset()a = []for i in range(n):t, b = list(map(int, input().split(' ')))if t == 1:a.append(b)st.add(b)else:a.append(-1)cnt = 0ans = [p]for i in range(min(k,len(st))):ans[0] += st[-1-i]R = nfor i in range(k):while R > 0 and a[R-1] != -1:st.discard(a[R-1])R -= 1R -= 1if R < 0:breakuse = k - i - 1tmp = pif use > len(st):ans.append(p)continuefor j in range(use):tmp += st[-1-j]ans.append(tmp)# print(ans)for i in range(len(ans)):ans[i] *= pow(2,i)peak = max(ans)# print(ans)if peak > int(1e18):print(-1)else:print(peak)