Submission #996457

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

boxes

#include "bits/stdc++.h"
#include "boxes.h"
using namespace std;
const int maxn = 1e7 + 7;
long long fcw[maxn], fccw[maxn];
long long delivery(int n, int k, int l, int pos[]) {
    for(int i = 1; i <= n; ++i) {
        fcw[i] = fcw[max(0, i - k)] + pos[i] + min(pos[i], l - pos[i]); 
    }
    for(int i = n; i; --i) {
        fccw[i] = fccw[min(n + 1, i + k)] + (l - pos[i]) + min(pos[i], l - pos[i]);
    }
    
    long long ans = min(fcw[n], fccw[0]);;
    for(int i = 0; i <= n; ++i) {
        ans = min(ans, fcw[i] + fccw[i + 1]);
    }
    return ans;
}

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