Submission #557591

#	Time	Username	Problem	Language	Result	Execution time	Memory
557591		Ai7081	선물상자 (IOI15_boxes)	C++17	100 / 100	524 ms	293772 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long

const int N = 1e7+5;
const ll inf = 1e18;

ll dp1[N], dp2[N], ans=inf;

ll delivery(int n, int k, int L, int pos[]) {
    for (int i=0; i<n; i++) dp1[i] = (ll)pos[i] + (i>=k ? dp1[i-k] : 0) + (ll)min(pos[i], L-pos[i]);
    for (int i=n-1; i>=0; i--) dp2[i] = (ll)(L-pos[i]) + (i+k<n ? dp2[i+k] : 0) + (ll)min(pos[i], L-pos[i]);
    for (int i=0; i<n-1; i++) ans = min(ans, dp1[i] + dp2[i+1]);
    ans = min(ans, min(dp1[n-1], dp2[0]));
    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