Submission #588538

#	Time	Username	Problem	Language	Result	Execution time	Memory
588538		Nicolaikrob	Boxes with souvenirs (IOI15_boxes)	C++17	20 / 100	1 ms	308 KiB

boxes

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

long long delivery(int N, int K, int L, int p[]) {
    long long o = 0;
    if(L == 1) return 0;
    if(K == 1) for(int i = 0; i < N; i++) o += 2*min(p[i], L-p[i]);
    else {
        int a = 0, b = 0;
        for(int i = 0; i < N; i++) {
            if(p[i] <= L>>1) a = max(a, 2*p[i]);
            else b = max(b, 2*(L-p[i]));
        }
        o = min(L, a+b);
    }
    return o;
}

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