Submission #1032576

#	Time	Username	Problem	Language	Result	Execution time	Memory
1032576		socpite	Boxes with souvenirs (IOI15_boxes)	C++17	0 / 100	38 ms	78928 KiB

boxes

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

const int maxn = 1e7+5;
const long long INF = 1e18;

long long cnt[maxn], ans[maxn], dp[maxn];

long long delivery(int N, int K, int L, int p[]) {
    memset(dp, 0, sizeof(dp));
    sort(p, p+N);
    long long re = 0;
    for(int i = 0; i < N; i++)re += 2*min(p[i], L - p[i]);
    for(int i = 0; i < N; i++)N -= (p[i] == 0);
    if(N == 0)return 0;
    int crr = 0;
    for(int i = 0; i < N; i++){
        if(p[i]==0)continue;
        dp[crr++%K] += p[i] + min(p[i], L - p[i]);
        ans[crr] = dp[(crr-1)%K];
    }
    memset(dp, 0, sizeof(dp));
    crr = 0;
    for(int i = N-1; i >= 0; i--){
        if(p[i]==0)continue;
        dp[crr++%K] += L - p[i] + min(p[i], L - p[i]);
        re = min(re, dp[(crr-1)%K] + ans[N - crr]);
    }
    return re;
}

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