제출 #1162191

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1162191		gustavo_d	Boxes with souvenirs (IOI15_boxes)	C++20	50 / 100	2095 ms	19780 KiB

boxes

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

typedef long long ll;

const ll INF = 1e18;

ll delivery(int n, int k, int len, int p[]) {
    ll ans = INF;
    ll dpL[n]; dpL[0] = 0;
    for (int i=0; i<=n; i++) {
        if (i != 0 and i <= k) dpL[i] = 2*p[i-1];
        else if (i != 0) dpL[i] = 2*p[i-1] + dpL[i-k];

        ll dpR[n]; dpR[0] = 0;
        for (int j=0; j<=n-i; j++) {
            if (j != 0 and j <= k) dpR[j] = 2*(len - p[n-j]);
            else if (j != 0) dpR[j] = 2LL*(len-p[n-j]) + dpR[j-k];

            ll tmp = (ll)((n - i - j + k - 1) / k) * (ll)len;
            tmp += dpL[i] + dpR[j];
            // cout << i << ' ' << j << ' ' << tmp << endl;
            ans = min(ans, tmp);
        }
    }
    return ans;
}

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