Submission #650631

#	Time	Username	Problem	Language	Result	Execution time	Memory
650631		birthdaycake	Boxes with souvenirs (IOI15_boxes)	C++17	0 / 100	2 ms	212 KiB

boxes

#include<bits/stdc++.h>
#include "boxes.h"

using  namespace std;


long long delivery(int n, int k, int l, int p[]) {
    int ans = INT_MAX;
    for(int i = 0; i < n; i++){
        int cur = 0, items = k, cost = 0, dist = 0;
        for(int j = 0; j <= i; j++){
            if(items == 0){
                items = k;
                cost += dist;
                cur = 0;
                dist = 0;
            }
            cost += (p[j] - cur);
            dist += (p[j] - cur);
            cur = p[j];
            items--;
        }
        cost += dist;
        
        items = k;
        cur = 0;
        dist = 0;
        for(int j = n - 1; j > i; j--){
            int nw = (l - 1) - p[j] + 1;
            if(items == 0){
                items = k;
                cost += dist;
                cur = 0;
                dist = 0;
            }
            cost += (nw - cur);
            dist += (nw - cur);
            cur = nw;
            items--;
        }
        ans = min(ans, cost + dist);
    }
    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