제출 #69569

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
69569		yusufake	선물상자 (IOI15_boxes)	C++98	100 / 100	646 ms	352608 KiB

boxes

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

#define lint long long
#define mx 10000007
#define mp make_pair
#define st first
#define nd second
pair<lint,int> Q[mx],QQ[mx];
lint i,dp,t,l,r,ll,rr;
lint delivery(int n, int k, int L, int *p){
    Q[r++] = mp(0,-1);
    QQ[rr++] = mp(min(L,2*(L-p[0])),-1);
    for(i=0;i<n;i++){
        if(Q[l].nd == i-k-1) l++;
        if(QQ[ll].nd == i-k-1) ll++;
        dp = Q[l].st + min(p[i]*2 , L);
        dp = min(dp , QQ[ll].st);
        if(i == n-1) return dp;
        for(; r > l && Q[r-1].st > dp ;) r--;
        t = dp + min(L , 2*(L-p[i+1]));
        for(; rr > ll && QQ[rr-1].st > t ;) rr--;
        Q[r++] = mp(dp,i);
        QQ[rr++] = mp(t,i);
    }
    return dp;
}

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