Submission #886434

#	Time	Username	Problem	Language	Result	Execution time	Memory
886434		heavylightdecomp	Boxes with souvenirs (IOI15_boxes)	C++14	20 / 100	1 ms	600 KiB

boxes

//K = N Assigning each person to a "half"
#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
long long delivery(int N, int K, int L, int p[]) {
    if(K == N) {
    ll obvious = L;
    ll lef = 0;
    ll rig = L;
    for(int i = 0; i < N; i++) {
        if(p[i] <= L/2) {
            lef = max(lef, (ll)p[i]);
        } else {
            rig = min(rig, (ll)p[i]);
        }
    }
    ll other = 2ll*lef + 2ll*(L-rig);
    return min(obvious, other);
    } else {
    ll res = 0;
    for(int i = 0; i < N; i++) {
        res += 2ll * min(p[i], L-p[i]);
    }
    return res;    
    }
}

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