Submission #422278

#	Time	Username	Problem	Language	Result	Execution time	Memory
422278		jlallas384	Boxes with souvenirs (IOI15_boxes)	C++17	35 / 100	1 ms	216 KiB

boxes

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


ll delivery(int n, int k, int l, int pi[]) {
    vector<int> p(n);
    for(int i = 0; i < n; i++){
        p[i] = pi[i];
    }
    ll fin = 1e18;
    for(int it = 0; it < 2; it++){
        ll ans = 0;
        int rev = 0,cur = 0,lft = k;
        for(int x: p){
            if(lft == 0){
                ans += min(cur,l - cur);
                lft = k;
                cur = 0;
            }
            if(!rev && cur != 0 && cur + l - x <= x - cur){
                rev = 1;
                ans += cur;
                cur = 0;
                lft = k;
            }
            lft--;
            ans += min(x - cur, cur + l - x);
            cur = x;
            if(cur == 0) lft = k;
        }
        fin = min(fin,ans + min(l - cur,cur));
        for(int &x: p){
            x = l - x;
        }
        sort(p.begin(), p.end());
    }
    return fin;
}

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