Submission #1293738

#	Time	Username	Problem	Language	Result	Execution time	Memory
1293738		AbdullahIshfaq	선물상자 (IOI15_boxes)	C++20	100 / 100	335 ms	196124 KiB

boxes

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define MOD 998244353
const int N = 2e7;
ll l[N], r[N];
long long delivery(int n, int k, int m, int p[])
{
    for (int i = 1; i <= n; i++){
        l[i] = l[max(0, i - k)] + min(p[i - 1] * 2, m);
    }
    reverse(p, p + n);
    for (int i = 1; i <= n; i++){
        r[i] = r[max(0, i - k)] + min((m - p[i - 1]) * 2, m);
    }
    ll ans = 1e18;
    for (int i = 0; i <= n; i++){
        ans = min(ans, l[i] + r[n - i]);
    }
    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