Submission #905174

#	Time	Username	Problem	Language	Result	Execution time	Memory
905174		VMaksimoski008	선물상자 (IOI15_boxes)	C++14	100 / 100	443 ms	196248 KiB

boxes

#include <iostream>
#include "boxes.h"

using namespace std;
using ll = long long;

ll min(ll a, ll b) { return (a < b ? a : b); }

ll delivery(int N, int K, int L, int pos[]) {
    ll left[N], right[N];

    for(int i=0; i<N; i++) {
        left[i] = pos[i] + min(pos[i], L - pos[i]) + (i < K ? 0 : left[i-K]);
        right[N-1-i] = L - pos[N-1-i] + min(pos[N-1-i], L - pos[N-1-i]) + (i < K ? 0 : right[N-1-i+K]);
    }

    ll ans = min(left[N-1], right[0]);
    for(int i=0; i<N-1; i++)
        ans = min(ans, left[i] + right[i+1]);
    return ans;
}

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