제출 #920043

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
920043		coding_snorlax	선물상자 (IOI15_boxes)	C++14	0 / 100	1 ms	600 KiB

boxes

#include "boxes.h"
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
vector<ll> P;
ll N,K,L;
long long split(int C){
    ll answer = 0;
    answer = 2*(P[C]+(L-P[C+1]));
    //cout << answer << " ";
    return answer;
}
long long delivery(int n, int k, int l, int p[]) {
    for(int i=0;i<N;i++) P.push_back((ll)p[i]);
    sort(P.begin(),P.end());
    ll answer = L,Max=0,Min=L;
    N=n;K=k;L=l;
    for(ll i:P) {Max = max(Max,(ll)i),Min = min(Min,(ll)i);}
    for(int i=0;i<N-1;i++){
        answer = min(split(i),answer);
    }
    answer = min(answer,2*min(Max,(ll)L-Min));
    return answer;
}

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