Submission #307390

#TimeUsernameProblemLanguageResultExecution timeMemory
307390juggernautBoxes with souvenirs (IOI15_boxes)C++14
100 / 100
821 ms294008 KiB
#include"boxes.h"
#include<bits/stdc++.h>
typedef long long int ll;
using namespace std;
ll pref[10000005],suf[10000005],ans,i;
ll delivery(int n,int k,int l,int a[]){
    sort(a,a+n);
    for(i=0;i<n;i++)pref[i]=(i<k?0:pref[i-k])+min(a[i]<<1ll,l);
    for(;i--;)suf[i]=(i<n-k?suf[i+k]:0)+min((l-a[i])<<1ll,l);
    ans=suf[0];
    for(i=0;i<n;i++)ans=min(ans,pref[i]+suf[i+1]);
    return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...