Submission #1266086

#	Time	Username	Problem	Language	Result	Execution time	Memory
1266086		scalifrastico_098	선물상자 (IOI15_boxes)	C++20	0 / 100	0 ms	324 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
long long delivery(int n, int k, int l, int p[]) {
    int kact=k, y=0, po=k; vector<int> a, b;
    for(int i=0; i<n; i++){if(p[i]<=l/2){a.push_back(p[i]);} else b.push_back(l-p[i]);}sort(a.begin(), a.end()); sort(b.begin(), b.end());reverse(a.begin(), a.end());
    for(int i=0; i<a.size(); i++)
    {
        y+=(2*p[i]); i+=kact-1; kact=k; 
    }
    for(int i=0; i<b.size(); i++)
    {
        y+=(2*(l-p[i])); i+=kact-1; kact=k;
    }
    return y;
}

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