結果
問題 | No.2182 KODOKU Stone |
ユーザー | Shirotsume |
提出日時 | 2022-09-21 01:54:49 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 5,406 bytes |
コンパイル時間 | 447 ms |
コンパイル使用メモリ | 82,424 KB |
実行使用メモリ | 334,204 KB |
最終ジャッジ日時 | 2024-11-14 12:05:44 |
合計ジャッジ時間 | 22,629 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 60 ms
76,008 KB |
testcase_01 | AC | 60 ms
69,152 KB |
testcase_02 | AC | 67 ms
72,316 KB |
testcase_03 | AC | 60 ms
67,928 KB |
testcase_04 | AC | 61 ms
69,372 KB |
testcase_05 | AC | 61 ms
68,800 KB |
testcase_06 | AC | 75 ms
74,548 KB |
testcase_07 | AC | 74 ms
74,520 KB |
testcase_08 | AC | 71 ms
72,880 KB |
testcase_09 | AC | 71 ms
74,224 KB |
testcase_10 | AC | 60 ms
68,588 KB |
testcase_11 | AC | 1,767 ms
247,968 KB |
testcase_12 | TLE | - |
testcase_13 | AC | 123 ms
92,868 KB |
testcase_14 | AC | 168 ms
80,036 KB |
testcase_15 | TLE | - |
testcase_16 | AC | 803 ms
174,228 KB |
testcase_17 | AC | 108 ms
90,156 KB |
testcase_18 | AC | 781 ms
150,108 KB |
testcase_19 | AC | 582 ms
104,904 KB |
testcase_20 | AC | 956 ms
140,408 KB |
testcase_21 | AC | 239 ms
80,848 KB |
testcase_22 | AC | 132 ms
79,392 KB |
testcase_23 | WA | - |
testcase_24 | AC | 299 ms
85,132 KB |
testcase_25 | AC | 121 ms
79,532 KB |
testcase_26 | AC | 118 ms
78,992 KB |
testcase_27 | AC | 116 ms
78,876 KB |
testcase_28 | AC | 580 ms
117,520 KB |
testcase_29 | AC | 713 ms
136,472 KB |
testcase_30 | AC | 1,201 ms
167,404 KB |
testcase_31 | AC | 821 ms
125,204 KB |
testcase_32 | AC | 820 ms
125,692 KB |
testcase_33 | AC | 681 ms
133,616 KB |
testcase_34 | AC | 267 ms
82,728 KB |
testcase_35 | AC | 701 ms
135,012 KB |
testcase_36 | AC | 255 ms
82,464 KB |
testcase_37 | AC | 1,171 ms
166,524 KB |
testcase_38 | WA | - |
testcase_39 | AC | 61 ms
334,204 KB |
ソースコード
import sysinput = lambda: sys.stdin.readline().rstrip()ii = lambda: int(input())mi = lambda: map(int, input().split())li = lambda: list(mi())inf = 2 ** 63 - 1mod = 998244353n = ii()k = li()[::-1]a = []for _ in range(n):_ = ii()a.append(list(sorted(li(), reverse=True)))a.sort(key = len, reverse=True)# 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 = 500def _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 ansdef check(x):A = SortedMultiset()B = SortedMultiset()for i in range(n):cnt = 0for v in a[i]:if v >= x:cnt += 1if cnt == len(a[i]):B.add(cnt)else:A.add(cnt)for i, nk in enumerate(k):if A and A.le(inf) >= nk:return Trueelif B and B.le(inf) >= nk:return Trueelif A and A.le(inf) == nk - 1 and i + 1 != len(k):A.discard(nk - 1)continueelif B:B.discard(B.ge(-inf))if i + 1 < len(k):continueelse:return Trueelse:return Falsereturn Falseok = 0ng = 10 ** 9 + 1while abs(ok - ng) > 1:mid = (ok + ng) // 2if check(mid):ok = midelse:ng = midprint(ok)