結果

問題 No.2248 max(C)-min(C)
ユーザー timitimi
提出日時 2023-03-17 23:28:16
言語 PyPy3
(7.3.15)
結果
TLE  
実行時間 -
コード長 4,995 bytes
コンパイル時間 513 ms
コンパイル使用メモリ 82,688 KB
実行使用メモリ 319,784 KB
最終ジャッジ日時 2024-09-18 12:32:01
合計ジャッジ時間 49,443 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 64 ms
67,968 KB
testcase_01 AC 71 ms
67,968 KB
testcase_02 AC 72 ms
67,456 KB
testcase_03 AC 95 ms
78,560 KB
testcase_04 AC 77 ms
74,112 KB
testcase_05 AC 77 ms
71,552 KB
testcase_06 AC 115 ms
79,860 KB
testcase_07 AC 117 ms
79,744 KB
testcase_08 AC 114 ms
79,668 KB
testcase_09 AC 123 ms
79,804 KB
testcase_10 AC 73 ms
71,808 KB
testcase_11 AC 119 ms
80,112 KB
testcase_12 AC 97 ms
79,016 KB
testcase_13 AC 104 ms
79,360 KB
testcase_14 AC 124 ms
80,136 KB
testcase_15 AC 117 ms
79,496 KB
testcase_16 AC 94 ms
78,080 KB
testcase_17 AC 113 ms
79,488 KB
testcase_18 AC 968 ms
260,900 KB
testcase_19 AC 262 ms
114,448 KB
testcase_20 AC 1,182 ms
302,916 KB
testcase_21 AC 1,111 ms
288,336 KB
testcase_22 AC 762 ms
255,388 KB
testcase_23 AC 526 ms
198,056 KB
testcase_24 AC 308 ms
115,672 KB
testcase_25 AC 1,065 ms
277,912 KB
testcase_26 AC 944 ms
262,780 KB
testcase_27 AC 1,033 ms
280,548 KB
testcase_28 AC 226 ms
106,652 KB
testcase_29 AC 984 ms
267,488 KB
testcase_30 AC 450 ms
161,272 KB
testcase_31 AC 1,210 ms
300,668 KB
testcase_32 AC 318 ms
124,460 KB
testcase_33 AC 428 ms
157,376 KB
testcase_34 AC 1,155 ms
303,904 KB
testcase_35 AC 1,178 ms
303,040 KB
testcase_36 AC 1,216 ms
302,864 KB
testcase_37 AC 636 ms
219,160 KB
testcase_38 AC 1,151 ms
269,876 KB
testcase_39 AC 1,161 ms
270,108 KB
testcase_40 AC 1,148 ms
270,404 KB
testcase_41 AC 960 ms
267,528 KB
testcase_42 AC 1,164 ms
270,396 KB
testcase_43 AC 986 ms
268,464 KB
testcase_44 AC 1,155 ms
270,168 KB
testcase_45 AC 914 ms
259,280 KB
testcase_46 AC 532 ms
179,212 KB
testcase_47 AC 1,158 ms
270,012 KB
testcase_48 AC 2,651 ms
270,064 KB
testcase_49 TLE -
testcase_50 TLE -
testcase_51 TLE -
testcase_52 TLE -
testcase_53 AC 585 ms
114,996 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

N=int(input())
A=list(map(int, input().split()))
B=list(map(int, input().split()))
if N==1:
  print(0)
  exit()

import sys
input = sys.stdin.readline
D={}
E=[]
EE=[]
for i in range(N):
  a,b,c=A[i],B[i],(A[i]+B[i])//2
  E.append(a)
  E.append(b)
  E.append(c)
  G=sorted([a,b,c])[::-1]
  EE.append(G)
  if a not in D:
    D[a]=[]
  if b not in D:
    D[b]=[]
  if c not in D:
    D[c]=[]
  D[a].append(i)
  D[b].append(i)
  D[c].append(i)
E=sorted(list(set(E)))[::-1]

# 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

st = SortedMultiset()
for i in range(N):
  st.add((max(A[i],B[i]),i))
M=[1]*N
ans=10**10
for e in E:
  ma=e 
  mi,j=st[0]
  ans=min(ans,ma-mi)
  f=0
  while st[-1][0]==e:
    j=st[-1][1]
    a,b=st[-1]
    st.discard((a,b))
    nex=M[j]
    if nex==3:
        print(ans)
        exit()
    st.add((EE[j][nex],j))
    M[j]+=1
0