Submission #1179345

#	Time	Username	Problem	Language	Result	Execution time	Memory
1179345		aguss	Boxes with souvenirs (IOI15_boxes)	C++20	0 / 100	0 ms	328 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
long long delivery(int N, int K, int L, int p[]) {
    ll ans = 0;
    vector<int> arr(N);
    for(int i = 0; i < N; i++){
        arr[i] = p[i];
    }
    sort(arr.rbegin(), arr.rend());
    if(!arr.back()){
        arr.pop_back();
    }
    const auto [mi, ma] = minmax_element(arr.begin(), arr.end());
    ll themax = L / 2;
    if(L & 1){
        themax = L / 2 + 1;
    }
    if(*mi > L / 2){
        ans = (L - *mi) * 2; 
    } else if(*ma < themax){
        ans = *ma * 2;
    } else ans = L;
    return ans;
}

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