Submission #1168817

#	Time	Username	Problem	Language	Result	Execution time	Memory
1168817		HappyCapybara	Boxes with souvenirs (IOI15_boxes)	C++17	100 / 100	428 ms	170944 KiB

boxes

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

#define ll long long

ll delivery(int N, int K, int L, int p[]) {
    vector<ll> l, r;
    for (int i=0; i<N; i++){
        if (p[i] <= L/2) l.push_back(p[i]);
        else r.push_back(L-p[i]);
    }
    reverse(r.begin(), r.end());
    vector<ll> lc(K+1, 0), rc(K+1, 0);
    for (int i=0; i<=K; i++){
        for (int j=l.size()-i-1; j>=0; j-=K) lc[i] += 2*l[j];
        for (int j=r.size()-i-1; j>=0; j-=K) rc[i] += 2*r[j];
    }
    ll res = lc[0]+rc[0];
    for (int i=0; i<=K; i++) res = min(res, L+lc[i]+rc[K-i]);
    return res;
}

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