Submission #993044

#	Time	Username	Problem	Language	Result	Execution time	Memory
993044		Mr_Husanboy	Boxes with souvenirs (IOI15_boxes)	C++17	10 / 100	1 ms	348 KiB

boxes

#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[]) {
    ll ans = 0;
    if(k == n){
        int mx = *max_element(p, p + n), mn = *min_element(p, p + n);
        return min({l, 2 * mn, 2 * (l - mx), (l - mx + mn)});
    }
    assert(k == 1);
    for(int i = 0; i < n; i ++){
        ans += min(p[i], l - p[i]) * 2;
    }
    return ans;
}

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