Submission #1265724

#	Time	Username	Problem	Language	Result	Execution time	Memory
1265724		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 <ll> num;
    set <ll> aux;
    ll ans = l;
    num.push_back(l);
    aux.insert(l);
    num.push_back(0);
    aux.insert(0);
    for(int i = 0; i < n; i++) {
        ll auxs = aux.size();
        aux.insert(p[i]);
        if(aux.size() > auxs) {
            num.push_back(p[i]);
        }
    }
    ll tam = num.size();
    sort(num.begin() , num.end());
    for(ll i = 0; i < tam-1; i++){
        if(n == 1) p[0]*2;
        ans = min(ans , 2*(l- (abs(num[i]) - num[i+1])));
    }
    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