Submission #308209

#	Time	Username	Problem	Language	Result	Execution time	Memory
308209		tengiz05	선물상자 (IOI15_boxes)	C++17	10 / 100	1 ms	384 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 1e7+5;
int n, k;
long long a[N], pref[N], suff[N];
long long delivery(int N, int K, int L, int p[]) {
	n = N;
	k = K;
	for(int i=1;i<=n;i++)a[i] = p[i-1];
	long long ans = 1e18;
	for(int i=1;i<=n;i++){
		pref[i] = pref[max(0, i-k)] + a[i]*2;
	}
	for(int i=n;i>=1;i--){
		suff[i] = suff[min(n+1, i+k)] + (L-a[i])*2;
	}
	for(int i=0;i<=n;i++){
		ans = min(ans, pref[i] + suff[i+1]);
	}
	for(int i=1;i<=n;i++){
		ans = min(ans, pref[i] + L + suff[min(n+1, i+k)]);
	}
	return ans;
}

Compilation message (stderr)

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:7:48: warning: declaration of 'N' shadows a global declaration [-Wshadow]
    7 | long long delivery(int N, int K, int L, int p[]) {
      |                                                ^
boxes.cpp:4:11: note: shadowed declaration is here
    4 | const int N = 1e7+5;
      |           ^

• Subtask 1: 10 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 15
• Subtask 4: 0 / 15
• Subtask 5: 0 / 20
• Subtask 6: 0 / 30