Submission #3806863


Source Code Expand

N, K = map(int, input().split())
a = [int(s) for s in input().split()]

ans = 0
cnt = sum(a[:K])

for i in range(N - K + 1):
    if i != 0:
        cnt += a[i + K - 1] - a[i - 1]
    ans += cnt

print(ans)

Submission Info

Submission Time
Task C - 総和
User ToshiroYanagi
Language Python (3.4.3)
Score 100
Code Size 216 Byte
Status AC
Exec Time 95 ms
Memory 14212 KB

Judge Result

Set Name sample subtask1 subtask2
Score / Max Score 0 / 0 50 / 50 50 / 50
Status
AC × 2
AC × 13
AC × 24
Set Name Test Cases
sample sample01.txt, sample02.txt
subtask1 00.txt, 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, sample01.txt, sample02.txt
subtask2 00.txt, 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, sample01.txt, sample02.txt, sample01.txt, sample02.txt
Case Name Status Exec Time Memory
00.txt AC 17 ms 2940 KB
01.txt AC 17 ms 2940 KB
02.txt AC 17 ms 3060 KB
03.txt AC 18 ms 3060 KB
04.txt AC 18 ms 3060 KB
05.txt AC 18 ms 3060 KB
06.txt AC 18 ms 3060 KB
07.txt AC 17 ms 3060 KB
08.txt AC 17 ms 3060 KB
09.txt AC 17 ms 3060 KB
10.txt AC 17 ms 3060 KB
11.txt AC 92 ms 14012 KB
12.txt AC 95 ms 14144 KB
13.txt AC 71 ms 14012 KB
14.txt AC 55 ms 14012 KB
15.txt AC 46 ms 14012 KB
16.txt AC 46 ms 14140 KB
17.txt AC 69 ms 14180 KB
18.txt AC 75 ms 4896 KB
19.txt AC 64 ms 14212 KB
sample01.txt AC 17 ms 3060 KB
sample02.txt AC 17 ms 3060 KB