Submission #1195780

#	Time	Username	Problem	Language	Result	Execution time	Memory
1195780		DeathIsAwe	Boxes with souvenirs (IOI15_boxes)	C++20	10 / 100	0 ms	328 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define ll long long
using namespace std;
ll dp[10000000], revdp[10000000], n, k, l;
vector<ll> p;


ll delivery(int N, int K, int L, int P[]) {
    n = N; k = K; l = L;
    for (int i=0;i<n;i++) {
        p.pb(P[i]);
        dp[i] = 0;
        revdp[i] = 0;
    }
    
    
    dp[0] = 0; revdp[0] = 0;
    ll leftlimit = n, rightlimit = n;
    for (int i=0;i<n;i++) {
        dp[i + 1] = min(l, 2 * p[i]) + dp[max((ll)0, i + 1 - k)];
    }
    for (int i=0;i<n;i++) {
        revdp[i + 1] = min(l, 2 * (l - p[n - i - 1])) + revdp[max((ll)0, i + 1 - k)];
    }


    ll ans = INT64_MAX, count = 0;
    if (l % 2 == 0) {
        for (int i=0;i<n;i++) {
            if (p[i] == l/2) count += 1;
        }
    } else {
        count = 0;
    }
    if (count % k != 0) {
        count + k * (count / k + 1);
    }


    for (int i=0;i<n;i++) {
        ans = min(ans, dp[max((ll)0, i - count + 1)] + revdp[max((ll)0, n - i - 1)] + (count / k) * l);
    }
    count += k;
    for (int i=0;i<n;i++) {
        ans = min(ans, dp[max((ll)0, i - count + 1)] + revdp[max((ll)0, n - i - 1)] + (count / k) * l);
    }


    return ans;
}

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