Submission #31214

#	Time	Username	Problem	Language	Result	Execution time	Memory
31214		top34051	Boxes with souvenirs (IOI15_boxes)	C++14	100 / 100	523 ms	196088 KiB

boxes

#include "boxes.h"
#include<bits/stdc++.h>
using namespace std;
#define maxn 10000005

long long L[maxn], R[maxn];

long long delivery(int N, int K, int len, int p[]) {
    int i;
    long long ans;
    for(i=0;i<N;i++)  L[i] = ((i-K>=0) ? L[i-K] : 0LL) + p[i]*2;
    for(i=N-1;i>=0;i--) R[i] = ((i+K<N) ? R[i+K] : 0LL) + (len-p[i])*2;
    ans = (long long)2e18;
    for(i=-1;i<N;i++) ans = min(ans,L[i]+R[i+1]);
    for(i=-1;i<N-K;i++) ans = min(ans,L[i]+R[i+K+1]+len);
    return ans;
}

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