제출 #238017

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
238017		Kubin	Boxes with souvenirs (IOI15_boxes)	C++11	35 / 100	5 ms	512 KiB

boxes

#include <bits/stdc++.h>

using namespace std;

long long delivery(int _n, int _k, int l, int p[])
{
    size_t n = _n, k = _k;
    vector<int> A[2];
    A[0].reserve(n); A[1].reserve(n);
    for(size_t i = 0; i < n; i++) if(p[i])
    {
        if(p[i] <= l/2) A[0].push_back(p[i]);
        else            A[1].push_back(l - p[i]);
    }
    reverse(A[1].begin(), A[1].end());

    size_t ni = A[0].size() + A[1].size();
    int64_t result = ni ? INT64_MAX : 0, base = 0;
    while(ni)
    {
        int64_t curr = base;
        for(size_t t = 0; t < 2; t++)
            for(size_t i = A[t].size() - 1; i < A[t].size(); i -= k)
                curr += 2 * A[t][i];
        result = min(result, curr);

        for(size_t i = 0; i < k and ni; i++, ni--)
        {
            if(A[0].empty())                    A[1].pop_back();
            else if(A[1].empty())               A[0].pop_back();
            else if(A[0].back() < A[1].back())  A[1].pop_back();
            else                                A[0].pop_back();
        }
        base += l;
    }
    result = min(result, base);

    return result;
}

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