Submission #765893

#	Time	Username	Problem	Language	Result	Execution time	Memory
765893		raysh07	Boxes with souvenirs (IOI15_boxes)	C++17	100 / 100	665 ms	264264 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
#define INF (long long) 1e18
 
long long delivery(int N, int K, int L, int a[]) {
    int n = N;
    int k = K;
    sort(a, a + n);
    vector<long long> dp1(n + 2, INF), dp2(n + 2, INF);
    
    dp1[0] = 0;
    dp2[n + 1] = 0;
    
    for (int i = 1; i <= n; i++){
        if (i <= k) dp1[i] = 2 * (a[i - 1]);
        else dp1[i] = dp1[i - k] + 2 * (a[i - 1]);
    }
    
    for (int i = n; i >= 1; i--){
        if (i + k <= n + 1) dp2[i] = dp2[i + k] + 2 * (L - a[i - 1]);
        else dp2[i] = 2 * (L - a[i - 1]);
    }
    
    long long ans = INF;
    if (n <= k) ans = L;
    
    for (int i = 0; i <= n; i++) ans = min(ans, dp1[i] + dp2[i + 1]);
    for (int i = 0; i <= n; i++){
        ans = min(ans, dp1[i] + L + dp2[i + 1 + k]);
    }
    
    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