結果

問題 No.2248 max(C)-min(C)
ユーザー ShirotsumeShirotsume
提出日時 2023-03-17 22:02:29
言語 PyPy3
(7.3.15)
結果
TLE  
実行時間 -
コード長 4,919 bytes
コンパイル時間 508 ms
コンパイル使用メモリ 82,652 KB
実行使用メモリ 277,248 KB
最終ジャッジ日時 2024-09-18 11:03:09
合計ジャッジ時間 57,203 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 63 ms
67,584 KB
testcase_01 AC 64 ms
67,072 KB
testcase_02 AC 64 ms
67,644 KB
testcase_03 AC 69 ms
69,760 KB
testcase_04 AC 68 ms
69,760 KB
testcase_05 AC 67 ms
68,992 KB
testcase_06 AC 78 ms
74,240 KB
testcase_07 AC 78 ms
73,600 KB
testcase_08 AC 92 ms
78,208 KB
testcase_09 AC 80 ms
74,240 KB
testcase_10 AC 68 ms
68,736 KB
testcase_11 AC 80 ms
74,112 KB
testcase_12 AC 72 ms
70,016 KB
testcase_13 AC 80 ms
74,496 KB
testcase_14 AC 79 ms
74,364 KB
testcase_15 AC 82 ms
75,136 KB
testcase_16 AC 70 ms
70,272 KB
testcase_17 AC 80 ms
74,368 KB
testcase_18 AC 1,098 ms
174,432 KB
testcase_19 AC 170 ms
83,584 KB
testcase_20 AC 1,341 ms
194,164 KB
testcase_21 AC 1,246 ms
184,476 KB
testcase_22 AC 819 ms
143,848 KB
testcase_23 AC 564 ms
121,864 KB
testcase_24 AC 225 ms
86,528 KB
testcase_25 AC 1,154 ms
178,640 KB
testcase_26 AC 1,124 ms
162,788 KB
testcase_27 AC 1,161 ms
176,344 KB
testcase_28 AC 154 ms
81,792 KB
testcase_29 AC 1,088 ms
155,128 KB
testcase_30 AC 417 ms
110,260 KB
testcase_31 AC 1,339 ms
193,628 KB
testcase_32 AC 298 ms
99,584 KB
testcase_33 AC 381 ms
108,344 KB
testcase_34 AC 1,398 ms
196,500 KB
testcase_35 AC 1,383 ms
195,968 KB
testcase_36 AC 1,375 ms
192,492 KB
testcase_37 AC 664 ms
130,388 KB
testcase_38 AC 2,455 ms
273,916 KB
testcase_39 AC 2,436 ms
273,072 KB
testcase_40 AC 2,482 ms
273,040 KB
testcase_41 AC 2,157 ms
274,112 KB
testcase_42 AC 2,454 ms
271,936 KB
testcase_43 AC 2,173 ms
271,820 KB
testcase_44 AC 2,453 ms
273,340 KB
testcase_45 AC 1,792 ms
251,832 KB
testcase_46 AC 919 ms
136,252 KB
testcase_47 AC 2,423 ms
272,440 KB
testcase_48 AC 1,607 ms
276,280 KB
testcase_49 AC 2,996 ms
274,344 KB
testcase_50 TLE -
testcase_51 TLE -
testcase_52 AC 2,965 ms
275,760 KB
testcase_53 AC 409 ms
98,756 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 = 20
    REBUILD_RATIO = 600

    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)
0