Submission #721178

Source Code Expand

N,K,=map(int,input().split(' '))
A=[int(i) for i in input().split(' ')]
ans=sum(A[0:K])
presum=ans
for i in range(1,N-K+1):
    presum=presum-A[i-1]+A[i+K-1]
    ans+=presum
print(ans)

Submission Info

Submission Time
Task C - 総和
User cpthgli
Language Python (3.4.3)
Score 100
Code Size 191 Byte
Status AC
Exec Time 183 ms
Memory 14392 KiB

Judge Result

Set Name sample subtask1 subtask2
Score / Max Score 0 / 0 50 / 50 50 / 50
Status
AC × 2
AC × 2
AC × 22
Set Name Test Cases
sample sample01.txt, sample02.txt
subtask1 00, 01, 02, 03, 04, 05, 06, 07, 08, 09, 10, 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
Case Name Status Exec Time Memory
00.txt AC 38 ms 3064 KiB
01.txt AC 39 ms 3064 KiB
02.txt AC 39 ms 3064 KiB
03.txt AC 39 ms 3188 KiB
04.txt AC 40 ms 3188 KiB
05.txt AC 39 ms 3188 KiB
06.txt AC 38 ms 3188 KiB
07.txt AC 39 ms 3188 KiB
08.txt AC 38 ms 3188 KiB
09.txt AC 39 ms 3188 KiB
10.txt AC 37 ms 3064 KiB
11.txt AC 177 ms 14016 KiB
12.txt AC 183 ms 14012 KiB
13.txt AC 141 ms 14016 KiB
14.txt AC 117 ms 14012 KiB
15.txt AC 108 ms 14140 KiB
16.txt AC 108 ms 14392 KiB
17.txt AC 140 ms 14180 KiB
18.txt AC 135 ms 4908 KiB
19.txt AC 131 ms 14212 KiB
sample01.txt AC 38 ms 3064 KiB
sample02.txt AC 39 ms 3064 KiB