Submission #666310

#	Time	Username	Problem	Language	Result	Execution time	Memory
666310		jamezzz	Boxes with souvenirs (IOI15_boxes)	C++17	10 / 100	1 ms	212 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;

#define LINF 1023456789123456789
typedef long long ll;
#define maxn 10000005

ll pfx[maxn], sfx[maxn];

ll delivery(int N,int K,int L,int p[]){
    sort(p,p+N);
    ll cur=0;
    for(int i=N-1;i>=0;--i){
        int cost=min(L,2*(L-p[i]));
        sfx[i]=cur+cost;
        if((N-i)%K==0)cur+=cost;
    }
    cur=0;
    ll ans=LINF;
    for(int i=0;i<N;++i){
        int cost=min(L,2*p[i]);
        ans=min(ans,cur+cost+sfx[i+1]);
        if(i%K==K-1)cur+=cost;
    }
    return ans;
}

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