結果
問題 | No.738 平らな農地 |
ユーザー | rlangevin |
提出日時 | 2024-02-07 12:06:59 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 590 ms / 2,000 ms |
コード長 | 6,326 bytes |
コンパイル時間 | 371 ms |
コンパイル使用メモリ | 81,572 KB |
実行使用メモリ | 118,004 KB |
最終ジャッジ日時 | 2024-02-07 12:07:37 |
合計ジャッジ時間 | 35,188 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 68 ms
70,060 KB |
testcase_01 | AC | 64 ms
70,060 KB |
testcase_02 | AC | 64 ms
70,060 KB |
testcase_03 | AC | 66 ms
70,060 KB |
testcase_04 | AC | 67 ms
70,060 KB |
testcase_05 | AC | 181 ms
79,928 KB |
testcase_06 | AC | 171 ms
79,928 KB |
testcase_07 | AC | 156 ms
79,160 KB |
testcase_08 | AC | 124 ms
78,520 KB |
testcase_09 | AC | 99 ms
77,628 KB |
testcase_10 | AC | 91 ms
77,384 KB |
testcase_11 | AC | 121 ms
78,392 KB |
testcase_12 | AC | 101 ms
77,500 KB |
testcase_13 | AC | 145 ms
78,776 KB |
testcase_14 | AC | 104 ms
77,624 KB |
testcase_15 | AC | 521 ms
104,524 KB |
testcase_16 | AC | 550 ms
107,820 KB |
testcase_17 | AC | 547 ms
107,700 KB |
testcase_18 | AC | 554 ms
104,528 KB |
testcase_19 | AC | 556 ms
108,276 KB |
testcase_20 | AC | 548 ms
107,824 KB |
testcase_21 | AC | 558 ms
108,268 KB |
testcase_22 | AC | 577 ms
107,828 KB |
testcase_23 | AC | 551 ms
108,048 KB |
testcase_24 | AC | 571 ms
107,816 KB |
testcase_25 | AC | 108 ms
77,880 KB |
testcase_26 | AC | 110 ms
77,880 KB |
testcase_27 | AC | 109 ms
77,880 KB |
testcase_28 | AC | 105 ms
77,752 KB |
testcase_29 | AC | 110 ms
77,880 KB |
testcase_30 | AC | 109 ms
77,880 KB |
testcase_31 | AC | 108 ms
77,752 KB |
testcase_32 | AC | 124 ms
77,752 KB |
testcase_33 | AC | 109 ms
77,752 KB |
testcase_34 | AC | 107 ms
77,752 KB |
testcase_35 | AC | 104 ms
77,752 KB |
testcase_36 | AC | 109 ms
77,752 KB |
testcase_37 | AC | 118 ms
77,880 KB |
testcase_38 | AC | 108 ms
77,752 KB |
testcase_39 | AC | 113 ms
77,880 KB |
testcase_40 | AC | 111 ms
77,880 KB |
testcase_41 | AC | 110 ms
77,880 KB |
testcase_42 | AC | 107 ms
77,880 KB |
testcase_43 | AC | 106 ms
77,752 KB |
testcase_44 | AC | 109 ms
77,880 KB |
testcase_45 | AC | 550 ms
110,508 KB |
testcase_46 | AC | 531 ms
105,716 KB |
testcase_47 | AC | 542 ms
109,784 KB |
testcase_48 | AC | 520 ms
109,460 KB |
testcase_49 | AC | 491 ms
108,372 KB |
testcase_50 | AC | 522 ms
109,796 KB |
testcase_51 | AC | 554 ms
110,032 KB |
testcase_52 | AC | 519 ms
108,440 KB |
testcase_53 | AC | 537 ms
109,568 KB |
testcase_54 | AC | 546 ms
110,028 KB |
testcase_55 | AC | 558 ms
110,036 KB |
testcase_56 | AC | 540 ms
109,788 KB |
testcase_57 | AC | 525 ms
105,584 KB |
testcase_58 | AC | 539 ms
109,676 KB |
testcase_59 | AC | 558 ms
110,500 KB |
testcase_60 | AC | 530 ms
110,388 KB |
testcase_61 | AC | 541 ms
110,272 KB |
testcase_62 | AC | 590 ms
105,716 KB |
testcase_63 | AC | 575 ms
110,504 KB |
testcase_64 | AC | 545 ms
110,128 KB |
testcase_65 | AC | 357 ms
107,712 KB |
testcase_66 | AC | 381 ms
108,040 KB |
testcase_67 | AC | 396 ms
113,064 KB |
testcase_68 | AC | 416 ms
117,364 KB |
testcase_69 | AC | 540 ms
117,748 KB |
testcase_70 | AC | 504 ms
110,768 KB |
testcase_71 | AC | 381 ms
95,560 KB |
testcase_72 | AC | 358 ms
99,412 KB |
testcase_73 | AC | 349 ms
101,500 KB |
testcase_74 | AC | 378 ms
101,716 KB |
testcase_75 | AC | 478 ms
113,356 KB |
testcase_76 | AC | 529 ms
117,628 KB |
testcase_77 | AC | 555 ms
113,356 KB |
testcase_78 | AC | 541 ms
110,832 KB |
testcase_79 | AC | 513 ms
110,408 KB |
testcase_80 | AC | 459 ms
118,004 KB |
testcase_81 | AC | 486 ms
116,916 KB |
testcase_82 | AC | 563 ms
117,344 KB |
testcase_83 | AC | 505 ms
99,676 KB |
testcase_84 | AC | 450 ms
99,296 KB |
testcase_85 | AC | 466 ms
116,716 KB |
testcase_86 | AC | 457 ms
111,768 KB |
testcase_87 | AC | 345 ms
115,896 KB |
testcase_88 | AC | 329 ms
111,580 KB |
testcase_89 | AC | 66 ms
70,060 KB |
testcase_90 | AC | 68 ms
70,056 KB |
testcase_91 | AC | 67 ms
70,060 KB |
ソースコード
import sys input = sys.stdin.readline # https://github.com/tatyam-prime/SortedSet/blob/main/SortedMultiset.py import math from bisect import bisect_left, bisect_right from typing import Generic, Iterable, Iterator, List, Tuple, TypeVar, Optional T = TypeVar('T') class SortedMultiset(Generic[T]): BUCKET_RATIO = 16 SPLIT_RATIO = 24 def __init__(self, a: Iterable[T] = []) -> None: "Make a new SortedMultiset from iterable. / O(N) if sorted / O(N log N)" a = list(a) n = self.size = len(a) if any(a[i] > a[i + 1] for i in range(n - 1)): a.sort() bucket_size = int(math.ceil(math.sqrt(n / self.BUCKET_RATIO))) self.a = [a[n * i // bucket_size : n * (i + 1) // bucket_size] for i in range(bucket_size)] 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 __eq__(self, other) -> bool: return list(self) == list(other) 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 _position(self, x: T) -> Tuple[List[T], int, int]: "return the bucket, index of the bucket and position in which x should be. self must not be empty." for i, a in enumerate(self.a): if x <= a[-1]: break return (a, i, bisect_left(a, x)) def __contains__(self, x: T) -> bool: if self.size == 0: return False a, _, i = self._position(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, b, i = self._position(x) a.insert(i, x) self.size += 1 if len(a) > len(self.a) * self.SPLIT_RATIO: mid = len(a) >> 1 self.a[b:b+1] = [a[:mid], a[mid:]] def _pop(self, a: List[T], b: int, i: int) -> T: ans = a.pop(i) self.size -= 1 if not a: del self.a[b] return ans def discard(self, x: T) -> bool: "Remove an element and return True if removed. / O(√N)" if self.size == 0: return False a, b, i = self._position(x) if i == len(a) or a[i] != x: return False self._pop(a, b, i) return True def lt(self, x: T) -> Optional[T]: "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) -> Optional[T]: "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) -> Optional[T]: "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) -> Optional[T]: "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, i: int) -> T: "Return the i-th element." if i < 0: for a in reversed(self.a): i += len(a) if i >= 0: return a[i] else: for a in self.a: if i < len(a): return a[i] i -= len(a) raise IndexError def pop(self, i: int = -1) -> T: "Pop and return the i-th element." if i < 0: for b, a in enumerate(reversed(self.a)): i += len(a) if i >= 0: return self._pop(a, ~b, i) else: for b, a in enumerate(self.a): if i < len(a): return self._pop(a, b, i) i -= 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 class Fenwick_Tree: def __init__(self, n): self._n = n self.data = [0] * n def add(self, p, x): assert 0 <= p < self._n p += 1 while p <= self._n: self.data[p - 1] += x p += p & -p def sum(self, l, r): assert 0 <= l <= r <= self._n return self._sum(r) - self._sum(l) def _sum(self, r): s = 0 while r > 0: s += self.data[r - 1] r -= r & -r return s from bisect import * from copy import * def compress(lst): B = [] D = dict() vals = deepcopy(lst) vals = list(set(vals)) vals.sort() for i in range(len(lst)): ind = bisect_left(vals, lst[i]) B.append(ind) for i in range(len(B)): D[lst[i]] = B[i] return B, D, vals N, K = map(int, input().split()) A = list(map(int, input().split())) + [-1] A, _, itov = compress(A) S = SortedMultiset() Ts = Fenwick_Tree(N + 5) Tn = Fenwick_Tree(N + 5) for i in range(K): S.add(A[i]) Ts.add(A[i], itov[A[i]]) Tn.add(A[i], 1) ind = S[K//2] ans = Ts.sum(ind + 1, N + 5) - Ts.sum(0, ind) + itov[ind] * (Tn.sum(0, ind) - Tn.sum(ind+1, N + 5)) for i in range(K, N): S.discard(A[i - K]) S.add(A[i]) Ts.add(A[i-K], -itov[A[i-K]]) Ts.add(A[i], itov[A[i]]) Tn.add(A[i-K], -1) Tn.add(A[i], 1) ind = S[K//2] val = itov[ind] ans = min(ans, Ts.sum(ind + 1, N + 5) - Ts.sum(0, ind) + val * (Tn.sum(0, ind) - Tn.sum(ind+1, N + 5))) print(ans)