Submission #989320

#	Time	Username	Problem	Language	Result	Execution time	Memory
989320		normankr07	Boxes with souvenirs (IOI15_boxes)	C++17	10 / 100	1 ms	348 KiB

boxes

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

#ifndef LOCAL
#define cerr \
    if (0)   \
    cerr
#endif

const bool multitest = 0;

const int MAXN = 1e7 + 5;
int pos[MAXN];

long long delivery(int N, int K, int L, int p[])
{
    vector<ll> lt(N + 3), rt(N + 3);
    for (int i = 1; i <= N; i++)
    {
        if (i - K >= 0)
        {
            lt[i] = lt[i - K] + p[i - 1] * 2;
            rt[i] = rt[i - K] + ((L - p[N - i]) * 2);
        }
        else
        {
            lt[i] = p[i - 1] * 2;
            rt[i] = ((L - p[N - i]) * 2);
        }
    }

    ll ans = 1e18;
    for (int i = 1; i <= N; i++)
    {
        ans = min(ans, lt[i] + rt[N - i]);
    }
    for (int i = 1; i <= N; i++)
    {
        ans = min(ans, lt[i] + rt[N - i] + L);
    }
    return ans;
}

/*
void solve()
{
    int n, k, l;
    cin >> n >> k >> l;
    for (int i = 0; i < n; i++)
    {
        cin >> pos[i];
    }
    cout << delivery(n, k, l, pos);
}

int32_t main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    if (fopen(taskname ".inp", "r"))
    {
        freopen(taskname ".inp", "r", stdin);
        freopen(taskname ".out", "w", stdout);
    }
    int tc = 1;
    if (multitest)
        cin >> tc;
    while (tc--)
    {
        solve();
        cout << '\n';
    }
}
*/

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