Submission #996922

#	Time	Username	Problem	Language	Result	Execution time	Memory
996922		TgX_2	Boxes with souvenirs (IOI15_boxes)	C++17	100 / 100	454 ms	293784 KiB

boxes

/*-----------------------------
        Author : TgX.2
       11Ti - K28 - CHV
-----------------------------*/
 
#ifndef TGX
    #include "boxes.h"
#endif // !TGX
 
 
#include <bits/stdc++.h>
using namespace std;
 
const int maxn = 1e7 + 7;
long long b[maxn], c[maxn];
long long delivery(int n, int k, int l, int a[]) {
//    sort(alln(a, n));
 
    for(int i = 1; i <= n; i++) {
        b[i] = min(l, a[i - 1] * 2);
        if (i > k)
            b[i] += b[i - k];
    }
 
    long long ans = b[n];
 
    for(int i = n; i >= 1; i--) {
        c[i] = min(l, (l - a[i - 1]) * 2);
        if (i + k <= n)
            c[i] += c[i + k];
        ans = min(ans, b[i - 1] + c[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