Submission #787025

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

boxes

#include "boxes.h"

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

ll delivery(int n, int k, int l, int p[]) {
    ll opa = 0;
    int res = 0;
    int s = 0;
    for (int i = 0; i < n; i++) {
        if (res == k-1 || i == n-1) {
            if (res == 0) s = p[i];
            if (s <= l/2-1) {
                opa += min(l, 2*p[i]);
            }
            else {
                opa += 2*(l-s);
            }
            res = 0;
            continue;
        }
        if (res == 0) {
            s = p[i];
            res++;
            continue;
        }
        res++;
    }
    if (k == 1) return opa;
    ll opb = 0;
    res = 0;
    s = 0;
    for (int i = n-1; i >= 0; i--) {
        if (res == k-1 || i == 0) {
            if (res == 0) s = p[i];
            if (s > l/2-1) {
                opb += min(l, 2*(l-p[i]));
            }
            else {
                opb += 2*s;
            }
            res = 0;
            continue;
        }
        if (res == 0) {
            s = p[i];
            res++;
            continue;
        }
        res++;
    }
    ll opc = 0;
    res = 0;
    for (int i = 0; i < n && p[i] <= l/2-1; i++) {
        if (res == k-1 || i == n-1 || p[i+1] > l/2-1) {
            opc += 2*p[i];
            res = 0;
            continue;
        }
        res++;
    }
    for (int i = n-1; i >= 0 && p[i] > l/2-1; i--) {
        if (res == k-1 || i == 0 || p[i-1] <= l/2-1) {
            opc += 2*(l-p[i]);
            res = 0;
            continue;
        }
        res++;
    }
    return min(min(opa, opa), opc);
}

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