Submission #778042

#	Time	Username	Problem	Language	Result	Execution time	Memory
778042		Jarif_Rahman	선물상자 (IOI15_boxes)	C++17	20 / 100	3 ms	312 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;

ll delivery(int n, int k, int L, int P[]){
    ll ans = 1e18;

    for(int i = 0; i <= n; i++){
        int r = k;
        ll cur = 0;
        for(int j = 0; j < i; j++){
            r--;
            if(j+1 == i || r == 0) cur+=P[j]+min(P[j], L-P[j]), r = k;
        }
        for(int j = n-1; j >= i; j--){
            r--;
            if(j == i || r == 0) cur+=L-P[j]+min(P[j], L-P[j]), r = k;
        }
        ans = min(ans, cur);
    }

    return ans;
}

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