Submission #430610

#TimeUsernameProblemLanguageResultExecution timeMemory
430610c4ts0upBoxes with souvenirs (IOI15_boxes)C++17
10 / 100
1 ms296 KiB
#include "boxes.h"

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

typedef long long ll;
#define pb push_back
#define ff first
#define ss second

ll n, k, l;
vector <ll> arr;

ll delivery(int N, int K, int L, int p[]) {
    // Cambia la entrada
    n = (ll)N;
    k = (ll)K;
    l = (ll)L;

    arr.resize(n);
    ll cnt = l;
    for (int i=0; i<n; i++) arr[i] = (ll)p[i];
    sort(arr.begin(), arr.end());

    for (int i=0; i<n-1; i++) {
        //cout << "Llendo hasta el elemento " << i << " en " << arr[i] << ", y al elemento " << i+1 << ", en " << arr[i+1] <<  " desde la derecha." << endl;
        //cout << "cnt = " << cnt << endl;

        // dos arcos
        cnt = min(cnt, 2LL*(arr[i] + (l-arr[i+1])));
    }

    // todo por la izquierda
    cnt = min(cnt, 2LL*arr[n-1]);
    // todo por la derecha
    cnt = min(cnt, 2LL*(l-arr[0]));

    return cnt;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...