#858373 (PyPy3) No.2304 Distinct Elements

提出ソース

結果

問題	No.2304 Distinct Elements
ユーザー	Shirotsume
提出日時	2023-04-11 02:10:30
言語	PyPy3 (7.3.15)
結果	WA
実行時間	-
コード長	5,132 bytes
コンパイル時間	259 ms
コンパイル使用メモリ	82,284 KB
実行使用メモリ	133,460 KB
最終ジャッジ日時	2024-11-14 12:50:16
合計ジャッジ時間	15,022 ms
ジャッジサーバーID （参考情報）	judge1 / judge2

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	63 ms 67,872 KB
testcase_01	AC	61 ms 69,128 KB
testcase_02	AC	60 ms 68,452 KB
testcase_03	AC	61 ms 68,512 KB
testcase_04	AC	315 ms 126,208 KB
testcase_05	AC	314 ms 126,704 KB
testcase_06	AC	304 ms 126,580 KB
testcase_07	AC	307 ms 126,448 KB
testcase_08	AC	304 ms 126,836 KB
testcase_09	AC	338 ms 123,148 KB
testcase_10	AC	342 ms 122,728 KB
testcase_11	AC	344 ms 122,500 KB
testcase_12	AC	340 ms 122,120 KB
testcase_13	AC	341 ms 122,748 KB
testcase_14	WA	-
testcase_15	WA	-
testcase_16	WA	-
testcase_17	WA	-
testcase_18	WA	-
testcase_19	AC	60 ms 68,800 KB
testcase_20	WA	-
testcase_21	AC	61 ms 69,244 KB
testcase_22	WA	-
testcase_23	AC	61 ms 68,868 KB
testcase_24	AC	64 ms 69,180 KB
testcase_25	AC	63 ms 68,052 KB
testcase_26	AC	64 ms 69,120 KB
testcase_27	AC	63 ms 68,660 KB
testcase_28	AC	63 ms 69,388 KB
testcase_29	AC	267 ms 121,312 KB
testcase_30	AC	151 ms 80,356 KB
testcase_31	AC	242 ms 111,312 KB
testcase_32	AC	278 ms 113,168 KB
testcase_33	AC	96 ms 79,000 KB
testcase_34	AC	283 ms 113,120 KB
testcase_35	AC	311 ms 117,308 KB
testcase_36	AC	92 ms 78,980 KB
testcase_37	AC	189 ms 86,476 KB
testcase_38	AC	305 ms 127,352 KB
testcase_39	AC	306 ms 127,192 KB
testcase_40	AC	253 ms 108,112 KB
testcase_41	AC	194 ms 87,252 KB
testcase_42	AC	280 ms 122,792 KB
testcase_43	AC	297 ms 130,144 KB
testcase_44	AC	257 ms 108,988 KB
testcase_45	AC	346 ms 97,972 KB
testcase_46	AC	275 ms 92,596 KB
testcase_47	AC	68 ms 71,752 KB
testcase_48	AC	68 ms 71,488 KB
testcase_49	AC	338 ms 130,432 KB
testcase_50	AC	321 ms 133,460 KB
testcase_51	AC	317 ms 133,352 KB
testcase_52	AC	326 ms 127,048 KB
testcase_53	AC	212 ms 117,816 KB
testcase_54	AC	327 ms 124,888 KB
testcase_55	AC	318 ms 123,664 KB
testcase_56	AC	311 ms 123,472 KB
testcase_57	WA	-
testcase_58	AC	337 ms 115,488 KB
testcase_59	WA	-
testcase_60	AC	60 ms 68,336 KB
testcase_61	AC	59 ms 67,848 KB

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

ソースコード

raw source code

import sys
from collections import deque, Counter
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()
a.append(-inf)
a.append(inf)
a.sort()
b = [a[i + 1] - a[i] for i in range(n + 1)]
S = SortedMultiset()
zero = []
for i, v in enumerate(b):
    if v == 0:
        zero.append(i)
    elif v > 1:
        S.add((i, v - 1))
ans = 0
for v in zero:
    lefti, leftv = S.le((v, inf))
    righti, rightv = S.ge((v, -inf))
    if abs(lefti - v) < abs(righti - v) or abs(lefti - v) == abs(righti - v) and leftv >= rightv:
        ans += abs(lefti - v)
        S.discard((lefti, leftv))
        if leftv > 1:
            S.add((lefti, leftv - 1))
    else:
        ans += abs(righti - v)
        S.discard((righti, rightv))
        if rightv > 1:
            S.add((righti, rightv - 1))
print(ans)

yukicoder

結果

テストケース

ソースコード