Submission #2529658
Source Code Expand
var t:int64; n,k,i:longint; a,s:array[0..100001] of int64; begin read(n,k); for i:=1 to n do read(a[i]); t:=0; s[k]:=0; for i:=1 to k do s[k]:=s[k]+a[i]; for i:=k+1 to n do begin s[i]:=s[i-1]-a[i-k]+a[i]; t:=t+s[i]; end; writeln(t); end.
Submission Info
Submission Time | |
---|---|
Task | C - 総和 |
User | luogu_bot5 |
Language | Pascal (FPC 2.6.2) |
Score | 0 |
Code Size | 298 Byte |
Status | WA |
Exec Time | 16 ms |
Memory | 1664 KB |
Compile Error
/usr/bin/ld.bfd: warning: ./link.res contains output sections; did you forget -T?
Judge Result
Set Name | sample | subtask1 | subtask2 | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 50 | 0 / 50 | ||||||
Status |
|
|
|
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 | WA | 0 ms | 128 KB |
01.txt | WA | 0 ms | 128 KB |
02.txt | WA | 0 ms | 128 KB |
03.txt | WA | 1 ms | 128 KB |
04.txt | WA | 1 ms | 128 KB |
05.txt | WA | 1 ms | 128 KB |
06.txt | WA | 1 ms | 128 KB |
07.txt | WA | 1 ms | 128 KB |
08.txt | WA | 1 ms | 128 KB |
09.txt | WA | 1 ms | 128 KB |
10.txt | WA | 1 ms | 128 KB |
11.txt | WA | 15 ms | 1664 KB |
12.txt | WA | 15 ms | 1664 KB |
13.txt | WA | 15 ms | 1280 KB |
14.txt | WA | 15 ms | 1024 KB |
15.txt | WA | 15 ms | 896 KB |
16.txt | WA | 15 ms | 896 KB |
17.txt | WA | 16 ms | 1280 KB |
18.txt | WA | 8 ms | 1536 KB |
19.txt | WA | 15 ms | 1152 KB |
sample01.txt | WA | 0 ms | 128 KB |
sample02.txt | WA | 0 ms | 128 KB |