Submission #1332721

#TimeUsernameProblemLanguageResultExecution timeMemory
1332721simplemind_31Boxes with souvenirs (IOI15_boxes)C++20
10 / 100
0 ms344 KiB
#include "boxes.h"
#include <bits/stdc++.h>
#define REV(x) x.rbegin(),x.rend()
using namespace std;
typedef long long ll;
ll delivery(int N, int K, int L, int p[]) {
    vector<ll> a(p,p+N);
    sort(a.begin(),a.end());
    vector<ll> iz(N+1),de(N+1);
    for(int i=1;i<=N;i++){
        if(i<=K)iz[i]=2*a[i-1];
        else iz[i]=iz[i-K]+2*a[i-1];
    }
    for(int i=1;i<=N;i++){
        if(i<=K)de[i]=2*(L-a[N-i]);
        else de[i]=de[i-K]+2*(L-a[N-i]);
    }
    ll ans=1e18;
    for(int i=0;i<=N;i++)ans=min(ans,iz[i]+de[N-i]);
    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...