Submission #70590

#	Time	Username	Problem	Language	Result	Execution time	Memory
70590		mr_banana	Boxes with souvenirs (IOI15_boxes)	C++17	100 / 100	698 ms	117788 KiB

boxes

#include <bits/stdc++.h>
#include "boxes.h"
using namespace std;
const int MN=1e7+10;
long long dp[MN];
long long delivery(int n, int k, int l, int p[]) {
    sort(p,p+n);
    for(int i=0;i<n;i++){
        dp[i]=min(2*p[i],l);
        if(i-k>=0){
            dp[i]+=dp[i-k];
        }
    }
    long long ans=dp[n-1];
    for(int i=n-1;i>=0;i--){
        dp[i]=min(2*(l-p[i]),l);
        if(i+k<n){
            dp[i]+=dp[i+k];
        }
        if(i){
            ans=min(ans,dp[i]+dp[i-1]);
        }
        else{
            ans=min(ans,dp[i]);
        }
    }
    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