結果

問題 No.1093 区間の和 / Sum of Range
ユーザー DrDrpilotDrDrpilot
提出日時 2022-04-13 15:58:46
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 482 ms / 2,000 ms
コード長 4,388 bytes
コンパイル時間 471 ms
コンパイル使用メモリ 87,204 KB
実行使用メモリ 105,124 KB
最終ジャッジ日時 2023-08-25 02:01:12
合計ジャッジ時間 15,394 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 174 ms
80,444 KB
testcase_01 AC 376 ms
90,364 KB
testcase_02 AC 275 ms
84,112 KB
testcase_03 AC 260 ms
103,916 KB
testcase_04 AC 205 ms
97,852 KB
testcase_05 AC 409 ms
89,156 KB
testcase_06 AC 253 ms
87,768 KB
testcase_07 AC 319 ms
88,860 KB
testcase_08 AC 318 ms
104,276 KB
testcase_09 AC 383 ms
85,992 KB
testcase_10 AC 319 ms
98,388 KB
testcase_11 AC 385 ms
90,392 KB
testcase_12 AC 331 ms
97,924 KB
testcase_13 AC 189 ms
82,212 KB
testcase_14 AC 455 ms
88,984 KB
testcase_15 AC 273 ms
90,440 KB
testcase_16 AC 470 ms
95,760 KB
testcase_17 AC 389 ms
84,872 KB
testcase_18 AC 336 ms
87,896 KB
testcase_19 AC 233 ms
84,224 KB
testcase_20 AC 325 ms
83,788 KB
testcase_21 AC 453 ms
88,780 KB
testcase_22 AC 453 ms
96,340 KB
testcase_23 AC 379 ms
84,860 KB
testcase_24 AC 257 ms
98,444 KB
testcase_25 AC 394 ms
89,004 KB
testcase_26 AC 367 ms
98,976 KB
testcase_27 AC 411 ms
87,412 KB
testcase_28 AC 354 ms
98,204 KB
testcase_29 AC 482 ms
105,124 KB
testcase_30 AC 255 ms
86,032 KB
testcase_31 AC 267 ms
91,176 KB
testcase_32 AC 299 ms
91,496 KB
testcase_33 AC 447 ms
97,272 KB
testcase_34 AC 232 ms
83,276 KB
testcase_35 AC 430 ms
83,808 KB
testcase_36 AC 415 ms
102,552 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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,k=map(int,input().split())
a=list(map(int,input().split()))
now=sum(a[0:k])
s=[now]
for i in range(1,n-k+1):
    now+=a[i+k-1]
    now-=a[i-1]
    s.append(now)
s=SortedMultiset(s)
q=int(input())
for _ in range(q):
    print(s.index_right(int(input())))
0