結果

問題 No.738 平らな農地
ユーザー rlangevinrlangevin
提出日時 2024-02-07 12:06:59
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 551 ms / 2,000 ms
コード長 6,326 bytes
コンパイル時間 496 ms
コンパイル使用メモリ 81,948 KB
実行使用メモリ 118,428 KB
最終ジャッジ日時 2024-09-28 12:27:55
合計ジャッジ時間 31,852 ms
ジャッジサーバーID
(参考情報)
judge3 / judge2
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 69 ms
69,376 KB
testcase_01 AC 68 ms
68,992 KB
testcase_02 AC 68 ms
68,864 KB
testcase_03 AC 69 ms
69,248 KB
testcase_04 AC 71 ms
69,120 KB
testcase_05 AC 175 ms
80,384 KB
testcase_06 AC 156 ms
80,824 KB
testcase_07 AC 152 ms
79,592 KB
testcase_08 AC 125 ms
78,976 KB
testcase_09 AC 101 ms
78,592 KB
testcase_10 AC 92 ms
77,912 KB
testcase_11 AC 125 ms
78,720 KB
testcase_12 AC 102 ms
78,060 KB
testcase_13 AC 150 ms
79,052 KB
testcase_14 AC 108 ms
77,960 KB
testcase_15 AC 480 ms
104,820 KB
testcase_16 AC 511 ms
108,512 KB
testcase_17 AC 498 ms
108,260 KB
testcase_18 AC 488 ms
104,700 KB
testcase_19 AC 486 ms
108,812 KB
testcase_20 AC 482 ms
108,516 KB
testcase_21 AC 550 ms
108,956 KB
testcase_22 AC 490 ms
108,632 KB
testcase_23 AC 525 ms
108,460 KB
testcase_24 AC 510 ms
108,248 KB
testcase_25 AC 110 ms
78,336 KB
testcase_26 AC 112 ms
78,208 KB
testcase_27 AC 111 ms
78,964 KB
testcase_28 AC 110 ms
78,164 KB
testcase_29 AC 112 ms
78,404 KB
testcase_30 AC 113 ms
78,700 KB
testcase_31 AC 108 ms
78,176 KB
testcase_32 AC 108 ms
78,464 KB
testcase_33 AC 108 ms
78,344 KB
testcase_34 AC 106 ms
78,464 KB
testcase_35 AC 105 ms
78,708 KB
testcase_36 AC 108 ms
78,328 KB
testcase_37 AC 109 ms
78,208 KB
testcase_38 AC 110 ms
78,296 KB
testcase_39 AC 113 ms
78,208 KB
testcase_40 AC 111 ms
78,580 KB
testcase_41 AC 112 ms
78,080 KB
testcase_42 AC 108 ms
78,208 KB
testcase_43 AC 107 ms
78,336 KB
testcase_44 AC 109 ms
78,208 KB
testcase_45 AC 481 ms
111,104 KB
testcase_46 AC 473 ms
106,704 KB
testcase_47 AC 508 ms
110,176 KB
testcase_48 AC 482 ms
109,988 KB
testcase_49 AC 480 ms
109,120 KB
testcase_50 AC 478 ms
110,560 KB
testcase_51 AC 508 ms
110,284 KB
testcase_52 AC 472 ms
108,700 KB
testcase_53 AC 478 ms
109,948 KB
testcase_54 AC 496 ms
110,452 KB
testcase_55 AC 500 ms
110,316 KB
testcase_56 AC 521 ms
110,716 KB
testcase_57 AC 488 ms
106,132 KB
testcase_58 AC 520 ms
110,020 KB
testcase_59 AC 512 ms
110,932 KB
testcase_60 AC 493 ms
110,616 KB
testcase_61 AC 506 ms
110,820 KB
testcase_62 AC 551 ms
106,580 KB
testcase_63 AC 508 ms
110,804 KB
testcase_64 AC 493 ms
110,952 KB
testcase_65 AC 331 ms
108,252 KB
testcase_66 AC 331 ms
108,464 KB
testcase_67 AC 367 ms
113,504 KB
testcase_68 AC 382 ms
117,660 KB
testcase_69 AC 513 ms
118,428 KB
testcase_70 AC 477 ms
111,312 KB
testcase_71 AC 334 ms
96,332 KB
testcase_72 AC 333 ms
99,836 KB
testcase_73 AC 317 ms
102,060 KB
testcase_74 AC 329 ms
102,264 KB
testcase_75 AC 433 ms
113,752 KB
testcase_76 AC 484 ms
118,072 KB
testcase_77 AC 476 ms
113,988 KB
testcase_78 AC 473 ms
111,252 KB
testcase_79 AC 446 ms
111,716 KB
testcase_80 AC 429 ms
118,396 KB
testcase_81 AC 442 ms
117,724 KB
testcase_82 AC 476 ms
117,852 KB
testcase_83 AC 480 ms
100,224 KB
testcase_84 AC 394 ms
100,480 KB
testcase_85 AC 439 ms
117,244 KB
testcase_86 AC 413 ms
112,416 KB
testcase_87 AC 324 ms
116,720 KB
testcase_88 AC 312 ms
112,520 KB
testcase_89 AC 70 ms
69,248 KB
testcase_90 AC 70 ms
68,992 KB
testcase_91 AC 68 ms
69,120 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

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)
0