제출 #712519

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
712519		Username4132	선물상자 (IOI15_boxes)	C++14	10 / 100	1 ms	340 KiB

boxes

#include "boxes.h"
#include<iostream>
using namespace std;
using ll = long long;
#define forn(i, n) for(int i=0; i<(int)n; ++i)
 
const int MAXN=10000010;
int le[MAXN], ri[MAXN], cnl=0, cnr=0;
ll dpl[MAXN], dpr[MAXN];
 
long long delivery(int N, int K, int L, int p[]) {
 
    forn(i, N){
        if(p[i]<=(L>>1)) le[cnl++]=p[i];
        else ri[cnr++]=L-p[i];
    }
 
    forn(i, cnl){
        if(i<K) dpl[i]=le[i];
        else dpl[i]=dpl[i-K]+le[i];
    }
    forn(i, cnr){
        if(i<K) dpr[i]=ri[i];
        else dpr[i]=dpr[i-K]+ri[i];
    }
 
    ll ans = (dpl[cnl-1]+dpr[cnr-1])<<1;
    forn(i, K+1){
        int il=cnl-1-i, ir=cnr-1-K+i;
        if(il>=0 && ir>=0) ans = min(ans, ((dpl[il] + dpr[ir])<<1) + L);
    }
 
    return ans;
}

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