제출 #1085449

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1085449		alexdd	Boxes with souvenirs (IOI15_boxes)	C++17	0 / 100	1 ms	348 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18;
long long delivery(int N, int K, int L, int p[])
{
    long long rez=INF;
    int pozle=0,pozri=N-1;
    int ramase=0;
    while(p[pozle]==0)
    {
        pozle++;
        ramase++;
    }
    long long cur=0;
    for(int cnt=(N-1)/K+1;cnt>=0;cnt--)
    {
        while(ramase < N - cnt*K)
        {
            int d = min(K, N - cnt*K - ramase);
            if(p[pozle+d-1] <= L - p[pozri-d+1])
            {
                cur += p[pozle+d-1]*2;
                pozle += d;
            }
            else
            {
                cur += (L - p[pozri-d+1])*2;
                pozri -= d;
            }
            ramase += d;
        }
        rez = min(rez, cnt*L + cur);
    }
    return rez;
}
/*
3 2 8
1 2 5
output: 10
*/

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