제출 #380147

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

boxes

#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> ii;
#define iii pair<ll,ii>
#define f(i,a,b) for(int i = a;i < b;i++)
#define pb push_back
#define vll vector<ll>
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
///I hope I will get uprating and don't make mistakes
///I will never stop programming
///sqrt(-1) Love C++
///Please don't hack me
///@TheofanisOrfanou Theo830
///Think different approaches (bs,dp,greedy,graphs,shortest paths,mst)
///Stay Calm
///Look for special cases
///Beware of overflow and array bounds
///Think the problem backwards
///Training
ll delivery(int n, int k, int l, int arr[]) {
    ll ans = 1e18;
    sort(arr,arr+n);
    f(p,0,n+1){
        int pos = 0;
        ll res = 0;
        while(p != 0){
            res += min(l,2 * arr[pos]);
            if(pos == p-1){
                break;
            }
            pos = min(p-1,pos+k);
        }
        int p2 = n - p;
        pos = 0;
        while(p2 != 0){
            res += min(l,2 * (l - arr[n-1-pos]));
            if(pos == p2-1){
                break;
            }
            pos = min(p2-1,pos+k);
        }
        ans = min(ans,res);
    }
    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