Submission #996464

#	Time	Username	Problem	Language	Result	Execution time	Memory
996464		fryingduc	선물상자 (IOI15_boxes)	C++17	100 / 100	420 ms	294172 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 = 0; i < n; ++i) {
        fcw[i] = pos[i] + min(pos[i], l - pos[i]); 
        if(i - k >= 0) fcw[i] += fcw[i - k];
    }
    for(int i = n - 1; i >= 0; --i) {
        fccw[i] = fccw[min(n, i + k)] + (l - pos[i]) + min(pos[i], l - pos[i]);
    }
    
    long long ans = min(fccw[0], fcw[n - 1]);
    for(int i = 0; i < n; ++i) {
        ans = min(ans, fcw[i] + fccw[i + 1]);
    }
    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