Submission #1091541

#	Time	Username	Problem	Language	Result	Execution time	Memory
1091541		triplem5ds	Boxes with souvenirs (IOI15_boxes)	C++14	0 / 100	1 ms	348 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>
long long cost[10000007];
long long delivery(int N, int K, int L, int p[]) {
    long long cur = 0;
    for(int i = 0, j = 0; i < N; i++) {
        if((j+=1) == K) j = 0;
        cost[i] = cur + p[i];
        if(j == 0) cur += p[i];
    }

    for(int i = N - 1, j = 0; i >= 0; i--) {
        if((j+=1) == K) j = 0;
        cost[i] += cur + L - p[i];
        if(j == 0) cur += L - p[i];
    }

    return *std::min_element(cost,cost+N);
}

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