제출 #748004

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
748004		Abrar_Al_Samit	선물상자 (IOI15_boxes)	C++17	100 / 100	599 ms	332916 KiB

boxes

#include <bits/stdc++.h>
#include "boxes.h"
using namespace std;
 
const int nax = 1e7 + 3;
const long long INF = 1e18;
 
 
long long dp[nax];
int n, k, L;
int a[nax]; 
int c[nax];
int assoc[nax];

long long delivery(int N, int K, int l, int p[]) {
    n = N, k = K, L = l;
    for(int i=1; i<=n; ++i) {
        a[i] = p[i-1];
        c[i] = min(a[i], L-a[i]);
    }

    for(int i=1; i<n; ++i) {
        if(a[i+1]-a[i]>L/2) {
            assoc[i] = a[i+1] - c[i] - c[i+1];
        } else {
            assoc[i] = a[i];
        }
    }
 
    for(int i=1; i<=n+1; ++i) {
        dp[i] = INF;
    }
    dp[1] = c[1];
        

    deque<pair<int, long long>>dq;
    for(int i=2; i<=n; ++i) {
        //erase from window
        if(!dq.empty() && dq.front().first<i-k) {
            dq.pop_front();
        }

        if(!dq.empty()) {
            dp[i] = dq.front().second;
            dp[i] += c[i-1] + c[i] + a[i-1];
        }

        dp[i] = min(dp[i], dp[i-1] + c[i-1] + c[i]);

        //insert to window
        while(!dq.empty() && dq.back().second>=dp[i-1]-assoc[i-1]) {
            dq.pop_back();
        }
        dq.push_back(make_pair(i-1, dp[i-1] - assoc[i-1]));
    }
 

    long long ans = INF;
    for(int i=1; i<=n; ++i) {
        if(i+k-1>=n) {
            ans = min(ans, a[n]-a[i]+dp[i]+c[n]);
        }
    }
    return ans;
}

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