Submission #1246394

#	Time	Username	Problem	Language	Result	Execution time	Memory
1246394		SpyrosAliv	Boxes with souvenirs (IOI15_boxes)	C++20	0 / 100	1 ms	324 KiB

boxes

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

int n, k, l;

long long delivery(int N, int K, int L, int p[]) {
    n = N;
    k = K;
    l = L;
    assert(k == n);
    ll ans = l;
    for (int i = 0; i < n; i++) {
        ll curr = p[i];
        ll prev;
        if (i > 0) prev = p[i-1];
        else prev = p[n-1];
        ll dis1 = min(prev, L - prev);
        ll dis2 = min(curr, L - curr);
        ans = min(ans, 2*dis1 + 2*dis2);
    }
    ans = min(ans, 2LL * (ll)(L - p[0]));
    ans = min(ans, 2LL * p[n-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