結果
| 問題 | No.1816 MUL-DIV Game |
| ユーザー |
 first_vil
|
| 提出日時 | 2022-01-21 21:42:19 |
| 言語 | PyPy3 (7.3.15) |
| 結果 |
AC
|
| 実行時間 | 464 ms / 2,000 ms |
| コード長 | 5,243 bytes |
| コンパイル時間 | 694 ms |
| コンパイル使用メモリ | 87,124 KB |
| 実行使用メモリ | 99,972 KB |
| 最終ジャッジ日時 | 2023-08-17 05:22:26 |
| 合計ジャッジ時間 | 10,143 ms |
|
ジャッジサーバーID （参考情報） |
judge11 / judge14 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 173 ms
80,252 KB |
| testcase_01 | AC | 176 ms
80,348 KB |
| testcase_02 | AC | 179 ms
80,368 KB |
| testcase_03 | AC | 176 ms
80,472 KB |
| testcase_04 | AC | 173 ms
80,340 KB |
| testcase_05 | AC | 176 ms
80,380 KB |
| testcase_06 | AC | 177 ms
80,504 KB |
| testcase_07 | AC | 173 ms
80,304 KB |
| testcase_08 | AC | 177 ms
80,300 KB |
| testcase_09 | AC | 183 ms
82,584 KB |
| testcase_10 | AC | 192 ms
86,636 KB |
| testcase_11 | AC | 192 ms
85,960 KB |
| testcase_12 | AC | 190 ms
84,708 KB |
| testcase_13 | AC | 376 ms
92,840 KB |
| testcase_14 | AC | 302 ms
89,296 KB |
| testcase_15 | AC | 322 ms
91,472 KB |
| testcase_16 | AC | 255 ms
85,892 KB |
| testcase_17 | AC | 422 ms
97,388 KB |
| testcase_18 | AC | 407 ms
95,740 KB |
| testcase_19 | AC | 317 ms
90,480 KB |
| testcase_20 | AC | 425 ms
97,668 KB |
| testcase_21 | AC | 301 ms
89,052 KB |
| testcase_22 | AC | 270 ms
87,244 KB |
| testcase_23 | AC | 175 ms
80,408 KB |
| testcase_24 | AC | 174 ms
80,392 KB |
| testcase_25 | AC | 464 ms
99,736 KB |
| testcase_26 | AC | 213 ms
97,784 KB |
| testcase_27 | AC | 452 ms
99,760 KB |
| testcase_28 | AC | 210 ms
97,748 KB |
| testcase_29 | AC | 457 ms
99,972 KB |
ソースコード
import sys
int1 = lambda x: int(x) - 1
# input = lambda: sys.stdin.buffer.readline()
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
i1 = lambda: int1(input())
mi = lambda: map(int, input().split())
mi1 = lambda: map(int1, input().split())
li = lambda: list(mi())
li1 = lambda: list(mi1())
lli = lambda n: [li() for _ in range(n)]
INF = float("inf")
mod = int(1e9 + 7)
# mod = 998244353
# https://github.com/tatyam-prime/SortedSet/blob/main/SortedMultiset.py
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 = ii()
a = li()
a.sort()
if n == 1:
print(a[0])
elif n == 2:
print(a[0] * a[1])
elif n & 1:
print(1)
else:
s = SortedMultiset(a)
for i in range(1, n):
if i & 1:
s0, s1 = s[0], s[1]
v = s0 * s1
s.discard(s0)
s.discard(s1)
s.add(v)
else:
s0, s1 = s[~0], s[~1]
s.discard(s0)
s.discard(s1)
s.add(1)
print(s[0])