Submission #1032585

#	Time	Username	Problem	Language	Result	Execution time	Memory
1032585		socpite	Boxes with souvenirs (IOI15_boxes)	C++17	100 / 100	530 ms	293668 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));
    for(int i = 0; i < N; i++){
        dp[i%K] += p[i] + min(p[i], L - p[i]);
        ans[i+1] = dp[i%K];
    }
    long long re = ans[N];
    memset(dp, 0, sizeof(dp));
    reverse(p, p + N);
    for(int i = 0; i < N; i++){
        dp[i%K] += L - p[i] + min(p[i], L - p[i]);
        re = min(re, dp[i%K] + ans[N - (i+1)]);
    }
    return re;
}

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