提出 #73215116

ソースコード 拡げる

import bisect
N, K, M = map(int,input().split())
A = list(map(int,input().split()))
B = [0] * (N + 1)
for i in range(N):
    B[i + 1] = B[i] + A[i]
ans = 0
for i in range(N):
    idx = bisect.bisect_left(B, M + B[i])
    if idx - i < K:
        idx = i + K
    if idx <= N:
        ans += N - idx + 1
print(ans)

提出情報

提出日時
問題 D - 連続練習日数
ユーザ chierin2
言語 Python (CPython 3.13.7)
得点 400
コード長 324 Byte
結果 AC
実行時間 141 ms
メモリ 31748 KiB

ジャッジ結果

セット名 Sample All
得点 / 配点 0 / 0 400 / 400
結果
AC × 3
AC × 75
セット名 テストケース
Sample sample01.txt, sample02.txt, sample03.txt
All sample01.txt, sample02.txt, sample03.txt, in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in30.txt, in31.txt, in32.txt, in33.txt, in34.txt, in35.txt, in36.txt, in37.txt, in38.txt, in39.txt, in40.txt, in41.txt, in42.txt, in43.txt, in44.txt, in45.txt, in46.txt, in47.txt, in48.txt, in49.txt, in50.txt, in51.txt, in52.txt, in53.txt, in54.txt, in55.txt, in56.txt, in57.txt, in58.txt, in59.txt, in60.txt, in61.txt, in62.txt, in63.txt, in64.txt, in65.txt, in66.txt, in67.txt, in68.txt, in69.txt, in70.txt, in71.txt, in72.txt
ケース名 結果 実行時間 メモリ
in01.txt AC 10 ms 9112 KiB
in02.txt AC 10 ms 9184 KiB
in03.txt AC 10 ms 9088 KiB
in04.txt AC 11 ms 9200 KiB
in05.txt AC 10 ms 9084 KiB
in06.txt AC 10 ms 9108 KiB
in07.txt AC 10 ms 9088 KiB
in08.txt AC 11 ms 9092 KiB
in09.txt AC 10 ms 9112 KiB
in10.txt AC 10 ms 9148 KiB
in11.txt AC 127 ms 31080 KiB
in12.txt AC 130 ms 31104 KiB
in13.txt AC 113 ms 31124 KiB
in14.txt AC 121 ms 31208 KiB
in15.txt AC 129 ms 31748 KiB
in16.txt AC 106 ms 18788 KiB
in17.txt AC 10 ms 9112 KiB
in18.txt AC 124 ms 30936 KiB
in19.txt AC 133 ms 30912 KiB
in20.txt AC 123 ms 30932 KiB
in21.txt AC 131 ms 31200 KiB
in22.txt AC 125 ms 31120 KiB
in23.txt AC 122 ms 31080 KiB
in24.txt AC 122 ms 26116 KiB
in25.txt AC 131 ms 31720 KiB
in26.txt AC 120 ms 30932 KiB
in27.txt AC 116 ms 31712 KiB
in28.txt AC 63 ms 20124 KiB
in29.txt AC 11 ms 9088 KiB
in30.txt AC 11 ms 9148 KiB
in31.txt AC 11 ms 9092 KiB
in32.txt AC 10 ms 9108 KiB
in33.txt AC 11 ms 9364 KiB
in34.txt AC 10 ms 9112 KiB
in35.txt AC 11 ms 9252 KiB
in36.txt AC 10 ms 9216 KiB
in37.txt AC 10 ms 9084 KiB
in38.txt AC 57 ms 16376 KiB
in39.txt AC 11 ms 9236 KiB
in40.txt AC 12 ms 9404 KiB
in41.txt AC 119 ms 18940 KiB
in42.txt AC 117 ms 21664 KiB
in43.txt AC 117 ms 21736 KiB
in44.txt AC 98 ms 18844 KiB
in45.txt AC 136 ms 31176 KiB
in46.txt AC 141 ms 29960 KiB
in47.txt AC 128 ms 27248 KiB
in48.txt AC 128 ms 31116 KiB
in49.txt AC 108 ms 18716 KiB
in50.txt AC 113 ms 18600 KiB
in51.txt AC 107 ms 31164 KiB
in52.txt AC 99 ms 19048 KiB
in53.txt AC 95 ms 26992 KiB
in54.txt AC 10 ms 9112 KiB
in55.txt AC 10 ms 9128 KiB
in56.txt AC 10 ms 9184 KiB
in57.txt AC 10 ms 9184 KiB
in58.txt AC 10 ms 9108 KiB
in59.txt AC 10 ms 9104 KiB
in60.txt AC 10 ms 9112 KiB
in61.txt AC 10 ms 9084 KiB
in62.txt AC 10 ms 9108 KiB
in63.txt AC 10 ms 9092 KiB
in64.txt AC 10 ms 9108 KiB
in65.txt AC 10 ms 9092 KiB
in66.txt AC 10 ms 9092 KiB
in67.txt AC 10 ms 9108 KiB
in68.txt AC 10 ms 9112 KiB
in69.txt AC 10 ms 9128 KiB
in70.txt AC 10 ms 9108 KiB
in71.txt AC 125 ms 31152 KiB
in72.txt AC 121 ms 31152 KiB
sample01.txt AC 10 ms 9112 KiB
sample02.txt AC 10 ms 9108 KiB
sample03.txt AC 10 ms 9092 KiB