結果

問題 No.2182 KODOKU Stone
ユーザー ShirotsumeShirotsume
提出日時 2022-09-21 01:57:32
言語 PyPy3
(7.3.15)
結果
TLE  
(最新)
AC  
(最初)
実行時間 -
コード長 5,483 bytes
コンパイル時間 476 ms
コンパイル使用メモリ 82,580 KB
実行使用メモリ 331,188 KB
最終ジャッジ日時 2024-11-14 12:06:07
合計ジャッジ時間 21,442 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 63 ms
74,900 KB
testcase_01 AC 63 ms
69,760 KB
testcase_02 AC 63 ms
68,984 KB
testcase_03 AC 63 ms
68,864 KB
testcase_04 AC 62 ms
68,528 KB
testcase_05 AC 63 ms
68,372 KB
testcase_06 AC 67 ms
70,768 KB
testcase_07 AC 69 ms
70,296 KB
testcase_08 AC 67 ms
71,272 KB
testcase_09 AC 69 ms
70,212 KB
testcase_10 AC 63 ms
68,256 KB
testcase_11 AC 859 ms
162,620 KB
testcase_12 TLE -
testcase_13 AC 122 ms
93,604 KB
testcase_14 AC 192 ms
85,920 KB
testcase_15 TLE -
testcase_16 AC 801 ms
153,668 KB
testcase_17 AC 113 ms
89,896 KB
testcase_18 AC 783 ms
135,472 KB
testcase_19 AC 522 ms
96,724 KB
testcase_20 AC 796 ms
122,560 KB
testcase_21 AC 223 ms
87,620 KB
testcase_22 AC 131 ms
85,940 KB
testcase_23 WA -
testcase_24 AC 334 ms
87,972 KB
testcase_25 AC 138 ms
85,912 KB
testcase_26 AC 140 ms
86,228 KB
testcase_27 AC 140 ms
86,172 KB
testcase_28 AC 685 ms
112,928 KB
testcase_29 AC 703 ms
123,404 KB
testcase_30 AC 979 ms
145,744 KB
testcase_31 AC 698 ms
112,396 KB
testcase_32 AC 561 ms
109,688 KB
testcase_33 AC 673 ms
122,504 KB
testcase_34 AC 254 ms
87,020 KB
testcase_35 AC 692 ms
122,964 KB
testcase_36 AC 222 ms
82,032 KB
testcase_37 AC 1,012 ms
144,488 KB
testcase_38 WA -
testcase_39 AC 65 ms
331,188 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
A = []
for i in range(n):
    for v in a[i]:
        A.append(v)


A.sort()
ok = 0
ng = len(A)
while abs(ok - ng) > 1:
    mid = (ok + ng) // 2
    if check(A[mid]):
        ok = mid
    else:
        ng = mid
print(A[ok])
0