Submission #421375

#	Time	Username	Problem	Language	Result	Execution time	Memory
421375		jlallas384	Boxes with souvenirs (IOI15_boxes)	C++17	20 / 100	1 ms	292 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 p[]) {
    auto dist = [&](int from,int to){
        if(from <= to) return min(to - from,from + l - to);
        return min(from - to,l - from + to);
    };
    ll ans = 0;
    int cur = 0, lft = k;
    for(int i = 0; i < n; i++){
        ans += dist(cur,p[i]);
        lft--;
        cur = p[i];
        if(lft == 0 && i != n - 1){
            ans += dist(cur,0);
            lft = k;
            cur = 0;
        }
    }
    return ans + dist(cur,0);
}

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