Submission #158347

#	Time	Username	Problem	Language	Result	Execution time	Memory
158347		johutha	Boxes with souvenirs (IOI15_boxes)	C++14	50 / 100	62 ms	29688 KiB

boxes

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

#define int long long

using namespace std;

int delivery(signed N, signed K, signed L, signed p[])
{
    vector<int> dfp_cl(N + 2);
    for (int i = 0; i < min(K, N); i++)
    {
        dfp_cl[i + 1] = 2*p[i];
    }
    for (int i = K; i < N; i++)
    {
        dfp_cl[i + 1] = dfp_cl[i - K + 1] + 2*p[i];
    }

    vector<int> dfp_cc(N + 2);
    for (int i = N - 1; i >= min(0, N - K); i--)
    {
        dfp_cc[i + 1] = 2*(L - p[i]);
    }
    for (int i = N - K; i >= 0; i--)
    {
        dfp_cc[i + 1] = dfp_cc[i + K + 1] + 2*(L - p[i]);
    }

    int ans = 1e12;
    for (int i = 0; i < N + 1; i++)
    {
        ans = min(ans, dfp_cl[i] + dfp_cc[i + 1]);
        if (i + K + 1 < N + 2) ans = min(ans, dfp_cl[i] + dfp_cc[i + K + 1] + L);
    }

    return ans;
}

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