Submission #2530234
Source Code Expand
#include <iostream> #include <algorithm> #include <map> #include <math.h> #include <string> #include <vector> typedef long long ll; using namespace std; int main(){ ll N, K; cin >> N >> K; vector<ll> a(N+1); a[0] = 0; for (int i = 0; i < N; i++){ ll n; cin >> n; a[i+1] = a[i]+n; } ll res = 0; for (int i = K; i <= N; i++){ res += a[i]-a[i-K]; } cout << res << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 総和 |
User | woodline23xx |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 462 Byte |
Status | AC |
Exec Time | 40 ms |
Memory | 1024 KB |
Judge Result
Set Name | sample | subtask1 | subtask2 | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 50 / 50 | 50 / 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 | AC | 1 ms | 256 KB |
01.txt | AC | 1 ms | 256 KB |
02.txt | AC | 1 ms | 256 KB |
03.txt | AC | 2 ms | 256 KB |
04.txt | AC | 2 ms | 256 KB |
05.txt | AC | 2 ms | 256 KB |
06.txt | AC | 2 ms | 256 KB |
07.txt | AC | 2 ms | 256 KB |
08.txt | AC | 2 ms | 256 KB |
09.txt | AC | 2 ms | 256 KB |
10.txt | AC | 2 ms | 256 KB |
11.txt | AC | 37 ms | 1024 KB |
12.txt | AC | 37 ms | 1024 KB |
13.txt | AC | 37 ms | 1024 KB |
14.txt | AC | 40 ms | 1024 KB |
15.txt | AC | 38 ms | 1024 KB |
16.txt | AC | 38 ms | 1024 KB |
17.txt | AC | 39 ms | 1024 KB |
18.txt | AC | 18 ms | 1024 KB |
19.txt | AC | 37 ms | 1024 KB |
sample01.txt | AC | 1 ms | 256 KB |
sample02.txt | AC | 1 ms | 256 KB |