結果
問題 | No.2304 Distinct Elements |
ユーザー | Shirotsume |
提出日時 | 2023-04-11 02:01:37 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 5,071 bytes |
コンパイル時間 | 453 ms |
コンパイル使用メモリ | 81,884 KB |
実行使用メモリ | 133,628 KB |
最終ジャッジ日時 | 2024-04-26 21:27:37 |
合計ジャッジ時間 | 17,165 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 80 ms
67,712 KB |
testcase_01 | AC | 73 ms
67,456 KB |
testcase_02 | AC | 75 ms
67,328 KB |
testcase_03 | AC | 73 ms
67,432 KB |
testcase_04 | AC | 357 ms
125,988 KB |
testcase_05 | AC | 350 ms
126,692 KB |
testcase_06 | AC | 355 ms
126,496 KB |
testcase_07 | AC | 351 ms
126,984 KB |
testcase_08 | AC | 348 ms
126,696 KB |
testcase_09 | AC | 371 ms
122,744 KB |
testcase_10 | AC | 370 ms
122,868 KB |
testcase_11 | AC | 375 ms
122,500 KB |
testcase_12 | AC | 376 ms
122,244 KB |
testcase_13 | AC | 377 ms
122,652 KB |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | AC | 74 ms
67,712 KB |
testcase_20 | WA | - |
testcase_21 | AC | 72 ms
67,328 KB |
testcase_22 | WA | - |
testcase_23 | AC | 74 ms
67,328 KB |
testcase_24 | AC | 75 ms
68,608 KB |
testcase_25 | AC | 75 ms
67,840 KB |
testcase_26 | AC | 75 ms
68,352 KB |
testcase_27 | AC | 75 ms
68,352 KB |
testcase_28 | AC | 76 ms
67,968 KB |
testcase_29 | AC | 302 ms
120,968 KB |
testcase_30 | AC | 161 ms
80,608 KB |
testcase_31 | AC | 274 ms
111,084 KB |
testcase_32 | AC | 301 ms
112,668 KB |
testcase_33 | AC | 106 ms
79,232 KB |
testcase_34 | AC | 310 ms
112,448 KB |
testcase_35 | AC | 335 ms
117,536 KB |
testcase_36 | AC | 110 ms
78,848 KB |
testcase_37 | AC | 215 ms
85,760 KB |
testcase_38 | AC | 358 ms
127,020 KB |
testcase_39 | AC | 361 ms
127,000 KB |
testcase_40 | AC | 286 ms
107,624 KB |
testcase_41 | AC | 218 ms
86,784 KB |
testcase_42 | AC | 335 ms
122,696 KB |
testcase_43 | AC | 338 ms
130,176 KB |
testcase_44 | AC | 280 ms
108,660 KB |
testcase_45 | WA | - |
testcase_46 | WA | - |
testcase_47 | AC | 83 ms
71,040 KB |
testcase_48 | AC | 81 ms
70,912 KB |
testcase_49 | AC | 376 ms
130,740 KB |
testcase_50 | AC | 354 ms
133,628 KB |
testcase_51 | AC | 357 ms
133,120 KB |
testcase_52 | AC | 369 ms
127,160 KB |
testcase_53 | AC | 233 ms
117,744 KB |
testcase_54 | AC | 363 ms
125,008 KB |
testcase_55 | AC | 358 ms
123,720 KB |
testcase_56 | AC | 356 ms
123,644 KB |
testcase_57 | WA | - |
testcase_58 | WA | - |
testcase_59 | WA | - |
testcase_60 | AC | 71 ms
67,456 KB |
testcase_61 | AC | 71 ms
67,712 KB |
ソースコード
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, 0)) righti, rightv = S.ge((v, 0)) if abs(lefti - v) <= abs(righti - v): ans += abs(lefti - v) S.discard((lefti, leftv)) if leftv > 0: S.add((lefti, leftv - 1)) else: ans += abs(righti - v) S.discard((righti, rightv)) if rightv > 0: S.add((righti, rightv - 1)) print(ans)