Submission #621940

#	Time	Username	Problem	Language	Result	Execution time	Memory
621940		Deepesson	Boxes with souvenirs (IOI15_boxes)	C++17	50 / 100	2094 ms	11964 KiB

boxes

#include <bits/stdc++.h>
long long delivery(int N, int K, int L, int p[]);
 
using ll = long long;
ll inf = 1LL<<60LL;
long long delivery(int N, int K, int L, int p[]) {
    ll dp[N+1];
    for(auto&x:dp)x=inf;
    dp[0]=0;
    for(int i=0;i!=N;++i){
        int c=0;
        for(int j=i;j!=-1;--j){
            ++c;
            dp[i+1]=std::min(dp[i+1],dp[j]+std::min({(ll)L,(ll)2*p[i],(ll)2*L-2*p[j]}));
            if(c==K)break;
        }
    }
    return dp[N];
}

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