Submission #422276

#	Time	Username	Problem	Language	Result	Execution time	Memory
422276		jlallas384	선물상자 (IOI15_boxes)	C++17	35 / 100	1 ms	300 KiB

boxes

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


ll delivery(int n, int k, int l, int pi[]) {
    vector<int> p(n);
    for(int i = 0; i < n; i++){
        p[i] = pi[i];
    }
    ll ans = 0;
    int rev = 0,cur = 0,lft = k;
    for(int x: p){
        if(lft == 0){
            ans += min(cur,l - cur);
            lft = k;
            cur = 0;
        }
        if(!rev && cur != 0 && cur + l - x <= x - cur){
            rev = 1;
            ans += cur;
            cur = 0;
            lft = k;
        }
        lft--;
        ans += min(x - cur, cur + l - x);
        cur = x;
    }
    return ans + min(l - cur,cur);
}

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