#948505 (PyPy3) No.738 平らな農地

提出ソース

結果

問題	No.738 平らな農地
ユーザー	rlangevin
提出日時	2024-02-07 08:59:58
言語	PyPy3 (7.3.15)
結果	WA
実行時間	-
コード長	6,108 bytes
コンパイル時間	233 ms
コンパイル使用メモリ	82,316 KB
実行使用メモリ	118,616 KB
最終ジャッジ日時	2024-09-28 12:23:48
合計ジャッジ時間	27,973 ms
ジャッジサーバーID （参考情報）	judge5 / judge2

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	WA	-
testcase_01	WA	-
testcase_02	AC	63 ms 70,012 KB
testcase_03	WA	-
testcase_04	WA	-
testcase_05	WA	-
testcase_06	WA	-
testcase_07	WA	-
testcase_08	AC	112 ms 78,900 KB
testcase_09	WA	-
testcase_10	WA	-
testcase_11	WA	-
testcase_12	AC	98 ms 78,168 KB
testcase_13	WA	-
testcase_14	WA	-
testcase_15	AC	434 ms 104,852 KB
testcase_16	WA	-
testcase_17	WA	-
testcase_18	AC	418 ms 105,372 KB
testcase_19	WA	-
testcase_20	AC	403 ms 108,416 KB
testcase_21	AC	444 ms 108,976 KB
testcase_22	WA	-
testcase_23	WA	-
testcase_24	AC	419 ms 108,408 KB
testcase_25	WA	-
testcase_26	AC	95 ms 78,480 KB
testcase_27	AC	98 ms 78,060 KB
testcase_28	AC	97 ms 78,456 KB
testcase_29	WA	-
testcase_30	WA	-
testcase_31	AC	98 ms 78,032 KB
testcase_32	WA	-
testcase_33	WA	-
testcase_34	WA	-
testcase_35	AC	94 ms 78,472 KB
testcase_36	AC	98 ms 78,044 KB
testcase_37	AC	96 ms 78,104 KB
testcase_38	AC	96 ms 78,264 KB
testcase_39	AC	96 ms 78,348 KB
testcase_40	AC	99 ms 78,636 KB
testcase_41	WA	-
testcase_42	AC	94 ms 78,340 KB
testcase_43	WA	-
testcase_44	WA	-
testcase_45	AC	439 ms 110,848 KB
testcase_46	WA	-
testcase_47	AC	435 ms 110,116 KB
testcase_48	WA	-
testcase_49	WA	-
testcase_50	WA	-
testcase_51	AC	441 ms 110,348 KB
testcase_52	AC	432 ms 108,844 KB
testcase_53	AC	422 ms 110,152 KB
testcase_54	AC	435 ms 110,368 KB
testcase_55	AC	448 ms 110,216 KB
testcase_56	WA	-
testcase_57	WA	-
testcase_58	AC	438 ms 110,140 KB
testcase_59	WA	-
testcase_60	WA	-
testcase_61	WA	-
testcase_62	WA	-
testcase_63	AC	460 ms 110,716 KB
testcase_64	AC	449 ms 110,760 KB
testcase_65	AC	271 ms 108,544 KB
testcase_66	AC	268 ms 108,768 KB
testcase_67	AC	319 ms 113,420 KB
testcase_68	WA	-
testcase_69	WA	-
testcase_70	WA	-
testcase_71	AC	262 ms 96,088 KB
testcase_72	AC	267 ms 99,668 KB
testcase_73	AC	261 ms 101,716 KB
testcase_74	AC	260 ms 102,072 KB
testcase_75	WA	-
testcase_76	WA	-
testcase_77	WA	-
testcase_78	AC	419 ms 110,348 KB
testcase_79	AC	388 ms 110,604 KB
testcase_80	AC	362 ms 118,220 KB
testcase_81	AC	378 ms 117,512 KB
testcase_82	WA	-
testcase_83	WA	-
testcase_84	WA	-
testcase_85	WA	-
testcase_86	AC	340 ms 112,256 KB
testcase_87	WA	-
testcase_88	AC	289 ms 111,504 KB
testcase_89	AC	63 ms 69,824 KB
testcase_90	WA	-
testcase_91	AC	63 ms 69,440 KB

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

ソースコード

raw source code

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()
T = Fenwick_Tree(N + 5)
for i in range(K):
    S.add(A[i])
    T.add(A[i], itov[A[i]])
    
ind = S[K//2]
ans = T.sum(ind + 1, N + 5) - T.sum(0, ind)
for i in range(K, N):
    S.discard(A[i - K])
    S.add(A[i])
    T.add(A[i-K], -itov[A[i-K]])
    T.add(A[i], itov[A[i]])
    ind = S[K//2]
    ans = min(ans, T.sum(ind + 1, N + 5) - T.sum(0, ind))
 
print(ans)

yukicoder

結果

テストケース

ソースコード