Submission #2121134


Source Code Expand

#include <iostream>
#include <climits>
#include <stack>
#include <queue>
#include <string>
#include <random>
#include <utility>
#include <string.h>
#include <iomanip>
#include <stdlib.h>
#include <algorithm>
using namespace std;
typedef pair<int,int> P;
int INF = 1<<29;
double Pi = 3.141592653589;
const int mod = 1000000007;
// memset(a,0,sizeof(a)); →全部0にする
 
long long int i,j;
 
int main(){
	long long int n,k;
	cin>>n>>k;
	long long int sum=0;
	long long int a,b;
	for(i=0;i<n;i++){
		cin>>a;
		b=min(i+1,n-i);
		sum+=min(b,n-k+1)*a;
	}


	cout<<sum<<endl; 
	return 0;
}

Submission Info

Submission Time
Task C - 総和
User enjapma
Language C++14 (GCC 5.4.1)
Score 0
Code Size 624 Byte
Status WA
Exec Time 38 ms
Memory 256 KB

Judge Result

Set Name sample subtask1 subtask2
Score / Max Score 0 / 0 0 / 50 0 / 50
Status
AC × 2
AC × 9
WA × 4
AC × 17
WA × 7
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 WA 1 ms 256 KB
02.txt AC 1 ms 256 KB
03.txt AC 1 ms 256 KB
04.txt WA 1 ms 256 KB
05.txt WA 2 ms 256 KB
06.txt WA 1 ms 256 KB
07.txt AC 1 ms 256 KB
08.txt AC 1 ms 256 KB
09.txt AC 2 ms 256 KB
10.txt AC 2 ms 256 KB
11.txt WA 37 ms 256 KB
12.txt WA 37 ms 256 KB
13.txt AC 37 ms 256 KB
14.txt AC 37 ms 256 KB
15.txt AC 37 ms 256 KB
16.txt AC 37 ms 256 KB
17.txt AC 38 ms 256 KB
18.txt WA 17 ms 256 KB
19.txt AC 38 ms 256 KB
sample01.txt AC 1 ms 256 KB
sample02.txt AC 1 ms 256 KB