Submission #115356

#	Time	Username	Problem	Language	Result	Execution time	Memory
115356		socho	Boxes with souvenirs (IOI15_boxes)	C++14	10 / 100	2 ms	384 KiB

boxes

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


long long delivery(int N, int K, int L, int p[]) {
    if (K == 1) {
        long long sm = 0;
        for (int i=0; i<N; i++) {
            long long res = min(p[i], L-p[i]);
            sm += res;
        }
        return sm * 2;
    }
    if (K == N) {
        int mx = p[N-1];
        int mn = p[0];
        int goingMn = mx * 2;
        int goingMx = (L-mn)*2;
        return min(L, min(goingMn, goingMx));
    }
    return 0;
}

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