Submission #1193566

#	Time	Username	Problem	Language	Result	Execution time	Memory
1193566		ElayV13	선물상자 (IOI15_boxes)	C++20	0 / 100	1 ms	324 KiB

boxes

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

const long long INF = 1e18;
const int N = 1e6 + 1;

long long dp[N];

long long cost(int N , int f , int l){
        return 2 * min(N - f , l);
}

long long delivery(int n , int k , int l , int p[])
{
        for(int i = 1;i <= n;i++) dp[i] = INF;
        dp[1] = cost(l  , p[0] , p[0]);
        for(int i = 2;i <= n - 1;i++)
        {
                int _i = i - 1;
                for(int j = i - 1;j >= 1;j--)
                {
                        int cnt = (i - j);
                        if(cnt > k) continue;
                        int last = p[_i];
                        int first = p[j + 1];
                        dp[i] = min(dp[i] , dp[j] + cost(l , first , last));
                }
                dp[i] = min(dp[i] , cost(l , p[0] , p[i - 1]));
        }
        long long res = INF;
        for(int i = 1;i <= n;i++) res = min(res , dp[i] + cost(l , p[i] , p[n - 1]));
        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