Submission #1034056

#	Time	Username	Problem	Language	Result	Execution time	Memory
1034056		Zicrus	Boxes with souvenirs (IOI15_boxes)	C++17	10 / 100	1 ms	348 KiB

boxes

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

typedef long long ll;

ll delivery(int n, int k, int l, int p11[]) {
    vector<ll> p(n);
    for (int i = 0; i < n; i++) p[i] = p11[i];

    ll sum = 0;
    ll first = 0, last = k-1;
    while (last < n-1) {
        sum += min(p[first], l-p[first]) + min(p[last]-p[first], l-(p[last]-p[first])) + min(p[last], l-p[last]);
        first += k; last += k;
    }
    last = n-1;
    sum += min(p[first], l-p[first]) + p[last]-p[first] + min(p[last], l-p[last]);
    return sum;
}

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