結果

問題 No.2248 max(C)-min(C)
ユーザー 👑 timitimi
提出日時 2023-03-17 23:28:16
言語 PyPy3
(7.3.15)
結果
TLE  
実行時間 -
コード長 4,995 bytes
コンパイル時間 334 ms
コンパイル使用メモリ 81,700 KB
実行使用メモリ 318,572 KB
最終ジャッジ日時 2023-10-18 16:30:43
合計ジャッジ時間 41,514 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 65 ms
67,836 KB
testcase_01 AC 66 ms
67,836 KB
testcase_02 AC 65 ms
67,836 KB
testcase_03 AC 92 ms
77,816 KB
testcase_04 AC 80 ms
73,864 KB
testcase_05 AC 74 ms
72,380 KB
testcase_06 AC 114 ms
78,892 KB
testcase_07 AC 117 ms
78,892 KB
testcase_08 AC 114 ms
78,888 KB
testcase_09 AC 118 ms
78,920 KB
testcase_10 AC 74 ms
72,380 KB
testcase_11 AC 123 ms
79,456 KB
testcase_12 AC 98 ms
78,028 KB
testcase_13 AC 109 ms
78,780 KB
testcase_14 AC 124 ms
79,472 KB
testcase_15 AC 119 ms
78,888 KB
testcase_16 AC 93 ms
77,820 KB
testcase_17 AC 115 ms
78,816 KB
testcase_18 AC 1,036 ms
260,064 KB
testcase_19 AC 348 ms
113,708 KB
testcase_20 AC 1,261 ms
302,124 KB
testcase_21 AC 1,197 ms
287,132 KB
testcase_22 AC 805 ms
254,620 KB
testcase_23 AC 548 ms
197,256 KB
testcase_24 AC 311 ms
114,468 KB
testcase_25 AC 1,083 ms
277,200 KB
testcase_26 AC 954 ms
261,804 KB
testcase_27 AC 1,081 ms
279,256 KB
testcase_28 AC 236 ms
106,040 KB
testcase_29 AC 1,001 ms
266,812 KB
testcase_30 AC 471 ms
160,196 KB
testcase_31 AC 1,212 ms
302,364 KB
testcase_32 AC 329 ms
122,544 KB
testcase_33 AC 438 ms
156,440 KB
testcase_34 AC 1,192 ms
302,908 KB
testcase_35 AC 1,218 ms
302,352 KB
testcase_36 AC 1,258 ms
302,356 KB
testcase_37 AC 651 ms
218,532 KB
testcase_38 AC 1,194 ms
269,256 KB
testcase_39 AC 1,167 ms
269,428 KB
testcase_40 AC 1,171 ms
269,684 KB
testcase_41 AC 970 ms
266,784 KB
testcase_42 AC 1,163 ms
269,576 KB
testcase_43 AC 1,014 ms
268,108 KB
testcase_44 AC 1,158 ms
269,388 KB
testcase_45 AC 912 ms
258,952 KB
testcase_46 AC 543 ms
178,740 KB
testcase_47 AC 1,173 ms
269,400 KB
testcase_48 AC 2,630 ms
269,168 KB
testcase_49 TLE -
testcase_50 TLE -
testcase_51 -- -
testcase_52 -- -
testcase_53 -- -
権限があれば一括ダウンロードができます

ソースコード

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