#850335 (PyPy3) No.2248 max(C)-min(C)

提出ソース

結果

問題	No.2248 max(C)-min(C)
ユーザー	Shirotsume
提出日時	2023-03-17 22:04:07
言語	PyPy3 (7.3.15)
結果	AC
実行時間	2,641 ms / 3,000 ms
コード長	4,919 bytes
コンパイル時間	199 ms
コンパイル使用メモリ	82,048 KB
実行使用メモリ	276,044 KB
最終ジャッジ日時	2024-09-18 11:05:37
合計ジャッジ時間	51,365 ms
ジャッジサーバーID （参考情報）	judge2 / judge3

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	59 ms 67,200 KB
testcase_01	AC	59 ms 67,456 KB
testcase_02	AC	60 ms 67,328 KB
testcase_03	AC	66 ms 70,272 KB
testcase_04	AC	66 ms 70,016 KB
testcase_05	AC	63 ms 68,352 KB
testcase_06	AC	74 ms 73,856 KB
testcase_07	AC	73 ms 74,240 KB
testcase_08	AC	88 ms 79,360 KB
testcase_09	AC	71 ms 74,496 KB
testcase_10	AC	64 ms 68,224 KB
testcase_11	AC	77 ms 73,472 KB
testcase_12	AC	70 ms 69,888 KB
testcase_13	AC	80 ms 73,988 KB
testcase_14	AC	76 ms 74,240 KB
testcase_15	AC	76 ms 74,880 KB
testcase_16	AC	64 ms 70,272 KB
testcase_17	AC	72 ms 74,624 KB
testcase_18	AC	945 ms 174,300 KB
testcase_19	AC	142 ms 83,208 KB
testcase_20	AC	1,185 ms 194,572 KB
testcase_21	AC	1,107 ms 183,580 KB
testcase_22	AC	737 ms 143,856 KB
testcase_23	AC	475 ms 121,344 KB
testcase_24	AC	192 ms 86,016 KB
testcase_25	AC	990 ms 178,596 KB
testcase_26	AC	936 ms 162,664 KB
testcase_27	AC	1,020 ms 176,484 KB
testcase_28	AC	138 ms 81,408 KB
testcase_29	AC	945 ms 154,884 KB
testcase_30	AC	357 ms 110,232 KB
testcase_31	AC	1,165 ms 193,768 KB
testcase_32	AC	252 ms 99,328 KB
testcase_33	AC	333 ms 108,352 KB
testcase_34	AC	1,267 ms 196,976 KB
testcase_35	AC	1,271 ms 196,608 KB
testcase_36	AC	1,255 ms 192,608 KB
testcase_37	AC	658 ms 130,128 KB
testcase_38	AC	2,173 ms 274,064 KB
testcase_39	AC	2,052 ms 273,040 KB
testcase_40	AC	2,084 ms 272,012 KB
testcase_41	AC	1,669 ms 244,584 KB
testcase_42	AC	2,069 ms 273,348 KB
testcase_43	AC	1,730 ms 254,400 KB
testcase_44	AC	2,090 ms 273,408 KB
testcase_45	AC	1,511 ms 236,212 KB
testcase_46	AC	786 ms 130,760 KB
testcase_47	AC	2,092 ms 272,692 KB
testcase_48	AC	1,255 ms 272,656 KB
testcase_49	AC	2,502 ms 274,412 KB
testcase_50	AC	2,489 ms 274,364 KB
testcase_51	AC	2,641 ms 276,044 KB
testcase_52	AC	2,518 ms 275,040 KB
testcase_53	AC	382 ms 99,776 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

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
# 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()
c = li()

for i in range(n):
    if a[i] > c[i]:
        a[i], c[i] = c[i], a[i]
A = [(a[i], i, 0) for i in range(n)]
C = [(c[i], i, 2) for i in range(n)]
b = [(a[i] + c[i]) // 2 for i in range(n)]
B = [(b[i], i, 1) for i in range(n)]
ALL = A + B + C

ALL.sort(key = lambda x: x[0])

S = SortedMultiset(a)
ans = INF
for v, i, t in ALL:
    ans = min(ans, S.le(INF) - v)
    if t == 0:
        S.discard(v)
        S.add(b[i])
    elif t == 1:
        S.discard(v)
        S.add(c[i])
    else:
        break
print(ans)

yukicoder

結果

テストケース

ソースコード