結果

問題 No.2182 KODOKU Stone
ユーザー ShirotsumeShirotsume
提出日時 2022-09-21 01:55:50
言語 PyPy3
(7.3.15)
結果
TLE  
(最新)
AC  
(最初)
実行時間 -
コード長 5,406 bytes
コンパイル時間 524 ms
コンパイル使用メモリ 82,252 KB
実行使用メモリ 332,288 KB
最終ジャッジ日時 2024-11-14 12:06:34
合計ジャッジ時間 26,802 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 66 ms
74,928 KB
testcase_01 AC 69 ms
322,040 KB
testcase_02 AC 76 ms
79,412 KB
testcase_03 AC 65 ms
69,536 KB
testcase_04 AC 65 ms
69,428 KB
testcase_05 AC 67 ms
68,964 KB
testcase_06 AC 81 ms
74,300 KB
testcase_07 AC 85 ms
74,484 KB
testcase_08 AC 77 ms
73,700 KB
testcase_09 AC 79 ms
73,900 KB
testcase_10 AC 68 ms
69,224 KB
testcase_11 TLE -
testcase_12 TLE -
testcase_13 AC 130 ms
92,976 KB
testcase_14 AC 184 ms
80,368 KB
testcase_15 TLE -
testcase_16 AC 1,238 ms
208,704 KB
testcase_17 AC 115 ms
90,228 KB
testcase_18 AC 1,136 ms
167,040 KB
testcase_19 AC 552 ms
102,104 KB
testcase_20 AC 927 ms
137,852 KB
testcase_21 AC 235 ms
80,712 KB
testcase_22 AC 130 ms
79,560 KB
testcase_23 WA -
testcase_24 AC 322 ms
84,408 KB
testcase_25 AC 130 ms
79,064 KB
testcase_26 AC 127 ms
79,316 KB
testcase_27 AC 124 ms
79,552 KB
testcase_28 AC 830 ms
125,744 KB
testcase_29 AC 1,034 ms
155,712 KB
testcase_30 AC 1,520 ms
181,000 KB
testcase_31 AC 1,034 ms
131,180 KB
testcase_32 AC 816 ms
120,692 KB
testcase_33 AC 990 ms
144,704 KB
testcase_34 AC 302 ms
82,660 KB
testcase_35 AC 1,004 ms
144,000 KB
testcase_36 AC 270 ms
82,232 KB
testcase_37 AC 1,519 ms
187,044 KB
testcase_38 WA -
testcase_39 AC 66 ms
332,288 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(mi())
inf = 2 ** 63 - 1
mod = 998244353

n = 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.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
def check(x):
    A = SortedMultiset()
    B = SortedMultiset()
    for i in range(n):
        cnt = 0
        for v in a[i]:
            if v >= x:
                cnt += 1
        if 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 True
        elif B and B.le(inf) >= nk:
            return True
        elif A and A.le(inf) == nk - 1 and i + 1 != len(k):
            A.discard(nk - 1)
            continue
        elif B:
            B.discard(B.ge(-inf))
            if i + 1 < len(k):
                continue
            else:
                return True
        else:
            return False
    return False
ok = 0
ng = 10 ** 9 + 1
while abs(ok - ng) > 1:
    mid = (ok + ng) // 2
    if check(mid):
        ok = mid
    else:
        ng = mid
print(ok)
0