Submission #154794

#	Time	Username	Problem	Language	Result	Execution time	Memory
154794		Mercenary	선물상자 (IOI15_boxes)	C++14	100 / 100	631 ms	293968 KiB

boxes

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

typedef long long ll;
typedef pair<int, int> ii;

const int maxn = 1e7 + 5;

ll a[maxn] , b[maxn];
ll res = 1e18;

ll delivery(int n , int k , int L, int* P)
{
    for(int i = 1 ; i <= n; ++i) a[i] = a[max(0, i- k)] + P[i - 1] + min(P[i - 1] , L - P[i - 1]);
    for(int i = n ; i >= 1; --i) b[i] = b[min(n + 1, i + k)]+ L - P[i - 1] + min(P[i - 1] , L - P[i - 1]);
    for(int i = 0 ; i <= n ; i++)res = min(res , a[i] + b[i + 1]);
    return res;
}

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