Submission #1454423
Source Code Expand
#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <string>
#include <map>
#include <numeric>
#include <bitset>
#include <vector>
#include <queue>
using namespace std;
typedef long long ll;
#define FOR(i,a,b) for(ll i = (a); i < (b); i++ )
#define REP(i, n) FOR(i,0,n)
typedef pair< ll, ll > cp2;
typedef pair< ll, cp2 > cp3;
#define fi first
#define se second
#define sec se.fi
#define thr se.se
const ll mod = 1000000007;
// 123456789
///////////////////////////////////////////////
//
//
///////////////////////////////////////////////
////////////////////////////////////////////////
////////////////////////////////////////////////
int N, K;
ll ans = 0;
ll A[112345];
ll sum = 0;
int main(){
cin>>N>>K;
REP( i, N ) scanf("%d", A+i);
REP( i, K ) sum += A[i];
FOR( i, K, N+1 ){
ans += sum;
sum += A[i];
sum -= A[i-K];
}
cout<<ans<<endl;
return 0;
}
Submission Info
Submission Time
2017-07-26 18:18:00+0900
Task
C - 総和
User
Ice_in_juice
Language
C++14 (GCC 5.4.1)
Score
100
Code Size
1005 Byte
Status
AC
Exec Time
13 ms
Memory
1024 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:45:29: warning: format ‘%d’ expects argument of type ‘int*’, but argument 2 has type ‘ll* {aka long long int*}’ [-Wformat=]
REP( i, N ) scanf("%d", A+i);
^
./Main.cpp:45:30: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
REP( i, N ) scanf("%d", A+i);
^
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
1 ms
256 KB
04.txt
AC
1 ms
256 KB
05.txt
AC
1 ms
256 KB
06.txt
AC
1 ms
256 KB
07.txt
AC
1 ms
256 KB
08.txt
AC
1 ms
256 KB
09.txt
AC
1 ms
256 KB
10.txt
AC
1 ms
256 KB
11.txt
AC
12 ms
1024 KB
12.txt
AC
12 ms
1024 KB
13.txt
AC
12 ms
1024 KB
14.txt
AC
12 ms
1024 KB
15.txt
AC
12 ms
1024 KB
16.txt
AC
12 ms
1024 KB
17.txt
AC
12 ms
1024 KB
18.txt
AC
9 ms
1024 KB
19.txt
AC
13 ms
1024 KB
sample01.txt
AC
1 ms
256 KB
sample02.txt
AC
1 ms
256 KB