제출 #996317

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

boxes

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

#define ll long long

ll delivery(int n, int k, int l, int p[]) {
    deque<int> dq;
    for(int i = 0; i < n; i ++)
        dq.push_back(p[i]);
    ll ans = 0;
    auto get = [&](int x){return min(x, l - x);};
    while(dq.size() > 0){
        int clock = dq[min((int)dq.size() - 1, k - 1)] + get(dq[min((int)dq.size() - 1, k - 1)]);
        int counterclock =  l - dq[max(0, (int)dq.size() - k)] + get(dq[max(0, (int)dq.size() - k)]);
        if(clock < counterclock){
            ans += clock;
            for(int i = 0; i < min((int)dq.size(), k); i ++)
                dq.pop_front();
        }
        else{
            ans += counterclock;
            for(int i = 0; i < min((int)dq.size(), k); i ++)
                dq.pop_back();
        }
    }
    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