Submission #1265699

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

boxes

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

long long delivery(int n, int k, int l, int p[]) {
    vector <int> num;
    num.push_back(0);
    for(int i = 0; i < n; i++) num.push_back(p[i]);
    sort(num.begin() , num.end());
    int min1 = l;
    for(ll i = 0; i < n; i++){
        min1 = min(min1 , 2*(l- (abs(num[i]) - num[i+1])));
    }
    return min1;
}

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