結果

問題 No.1093 区間の和 / Sum of Range
ユーザー lloyzlloyz
提出日時 2022-10-08 09:51:12
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 538 ms / 2,000 ms
コード長 4,529 bytes
コンパイル時間 283 ms
コンパイル使用メモリ 87,112 KB
実行使用メモリ 99,260 KB
最終ジャッジ日時 2023-09-04 09:31:03
合計ジャッジ時間 19,590 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 181 ms
80,416 KB
testcase_01 AC 441 ms
89,828 KB
testcase_02 AC 300 ms
84,100 KB
testcase_03 AC 336 ms
96,984 KB
testcase_04 AC 278 ms
98,648 KB
testcase_05 AC 466 ms
88,168 KB
testcase_06 AC 307 ms
87,936 KB
testcase_07 AC 368 ms
89,088 KB
testcase_08 AC 379 ms
99,260 KB
testcase_09 AC 435 ms
86,244 KB
testcase_10 AC 377 ms
94,008 KB
testcase_11 AC 437 ms
89,284 KB
testcase_12 AC 402 ms
92,584 KB
testcase_13 AC 206 ms
82,872 KB
testcase_14 AC 480 ms
87,284 KB
testcase_15 AC 312 ms
88,620 KB
testcase_16 AC 529 ms
92,284 KB
testcase_17 AC 433 ms
84,624 KB
testcase_18 AC 395 ms
86,980 KB
testcase_19 AC 262 ms
84,660 KB
testcase_20 AC 375 ms
85,596 KB
testcase_21 AC 493 ms
87,688 KB
testcase_22 AC 519 ms
92,852 KB
testcase_23 AC 407 ms
84,840 KB
testcase_24 AC 311 ms
97,300 KB
testcase_25 AC 423 ms
89,800 KB
testcase_26 AC 437 ms
93,992 KB
testcase_27 AC 478 ms
87,456 KB
testcase_28 AC 424 ms
93,692 KB
testcase_29 AC 538 ms
96,760 KB
testcase_30 AC 301 ms
86,280 KB
testcase_31 AC 315 ms
87,936 KB
testcase_32 AC 336 ms
90,340 KB
testcase_33 AC 495 ms
93,952 KB
testcase_34 AC 269 ms
84,156 KB
testcase_35 AC 473 ms
84,152 KB
testcase_36 AC 481 ms
97,356 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

# 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, k = map(int, input().split())
A = list(map(int, input().split()))
multi_set = SortedMultiset()
res = 0
for i in range(n):
    res += A[i]
    if i >= k - 1:
        multi_set.add(res)
        res -= A[i - k + 1]
q = int(input())
for _ in range(q):
    x = int(input())
    print(multi_set.index_right(x))
0