제출 #1265741

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1265741		martin_011	Boxes with souvenirs (IOI15_boxes)	C++20	0 / 100	2096 ms	324 KiB

boxes

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

using namespace std;

typedef long long ll;
typedef vector<ll> vll;
typedef vector<int> vi;

long long delivery(int n, int k, int l, int p[]) {
    vi a(n, 0);
    for (int i=0; i<n; i++) {
        a[i] = p[i];
    }
    ll res = l;
    do {
        ll aux = k-1;
        ll r = min(a[0], l-a[0]);
        for (int i=1; i<n; i++) {
            if (aux <= 0) {
                r+= 2  * min(a[i-1], l - a[i-1]);
                aux = k;
            }
            r += min(abs(a[i] - a[i-1]), min(a[i], a[i-1]) + l - max(a[i], a[i-1]));
            aux--;
        }
        if (aux <= 0) {
            r+= 2 * min(a[n-2], l - a[n-2]);
        }
        r+= min(a[n-1], l-a[n-1]);
        res = min(res, r);
    } while(next_permutation(a.begin(), a.end()));
    return res;
}

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