Submission #928170

#	Time	Username	Problem	Language	Result	Execution time	Memory
928170		AlphaMale06	Boxes with souvenirs (IOI15_boxes)	C++17	100 / 100	616 ms	269920 KiB

boxes

#include <bits/stdc++.h>

using namespace std;

using ll = long long;

const int N = 1e7+3;
ll dp[N];
ll rdp[N];

ll delivery(int n, int k, int l, int a[]) {
    sort(a, a+n);
    for(int i=1; i<= n; i++)dp[i]=dp[i-min(i, k)]+min(l, 2*a[i-1]);
    for(int i=n; i>=1; i--)rdp[i]=rdp[i+min(n+1-i, k)]+min(l, 2*(l-a[i-1]));
    ll ans=min(rdp[1], dp[n]);
    for(int i=1; i<n; i++)ans=min(ans, dp[i]+rdp[i+1]);
    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