結果

問題 No.2248 max(C)-min(C)
ユーザー ShirotsumeShirotsume
提出日時 2023-03-17 22:07:50
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,513 ms / 3,000 ms
コード長 5,016 bytes
コンパイル時間 363 ms
コンパイル使用メモリ 81,792 KB
実行使用メモリ 265,436 KB
最終ジャッジ日時 2024-09-18 11:12:43
合計ジャッジ時間 27,475 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 66 ms
67,200 KB
testcase_01 AC 65 ms
66,944 KB
testcase_02 AC 66 ms
67,456 KB
testcase_03 AC 71 ms
69,888 KB
testcase_04 AC 72 ms
69,376 KB
testcase_05 AC 68 ms
67,584 KB
testcase_06 AC 75 ms
73,216 KB
testcase_07 AC 78 ms
73,472 KB
testcase_08 AC 82 ms
74,752 KB
testcase_09 AC 78 ms
73,600 KB
testcase_10 AC 66 ms
67,712 KB
testcase_11 AC 75 ms
72,832 KB
testcase_12 AC 70 ms
70,016 KB
testcase_13 AC 77 ms
73,600 KB
testcase_14 AC 84 ms
73,728 KB
testcase_15 AC 81 ms
74,240 KB
testcase_16 AC 71 ms
69,504 KB
testcase_17 AC 77 ms
73,088 KB
testcase_18 AC 319 ms
137,040 KB
testcase_19 AC 107 ms
83,456 KB
testcase_20 AC 348 ms
147,864 KB
testcase_21 AC 336 ms
146,600 KB
testcase_22 AC 274 ms
144,228 KB
testcase_23 AC 209 ms
113,648 KB
testcase_24 AC 127 ms
86,656 KB
testcase_25 AC 325 ms
140,220 KB
testcase_26 AC 315 ms
136,424 KB
testcase_27 AC 318 ms
137,536 KB
testcase_28 AC 115 ms
81,792 KB
testcase_29 AC 311 ms
140,028 KB
testcase_30 AC 186 ms
104,496 KB
testcase_31 AC 343 ms
147,716 KB
testcase_32 AC 131 ms
88,192 KB
testcase_33 AC 177 ms
101,436 KB
testcase_34 AC 373 ms
152,720 KB
testcase_35 AC 371 ms
151,436 KB
testcase_36 AC 348 ms
146,656 KB
testcase_37 AC 223 ms
124,236 KB
testcase_38 AC 1,179 ms
233,616 KB
testcase_39 AC 1,176 ms
235,536 KB
testcase_40 AC 1,165 ms
233,352 KB
testcase_41 AC 988 ms
189,688 KB
testcase_42 AC 1,187 ms
245,780 KB
testcase_43 AC 1,026 ms
204,016 KB
testcase_44 AC 1,178 ms
221,992 KB
testcase_45 AC 909 ms
169,520 KB
testcase_46 AC 529 ms
110,984 KB
testcase_47 AC 1,189 ms
248,700 KB
testcase_48 AC 1,225 ms
263,320 KB
testcase_49 AC 1,505 ms
265,436 KB
testcase_50 AC 1,500 ms
263,332 KB
testcase_51 AC 1,513 ms
264,144 KB
testcase_52 AC 1,504 ms
264,540 KB
testcase_53 AC 313 ms
89,396 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
# 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] * 10 ** 9 + i * 10) for i in range(n)]
C = [(c[i] * 10 ** 9 + i * 10 + 2) for i in range(n)]
b = [(a[i] + c[i]) // 2 for i in range(n)]
B = [(b[i] * 10 ** 9 + i * 10 + 1) for i in range(n)]
ALL = A + B + C

ALL.sort()

S = SortedMultiset(a)
ans = INF
for V in ALL:
    v = V // 10 ** 9
    i = (V % 10 ** 9) // 10
    t = (V % 10 ** 9) % 10
    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)
0