제출 #444476

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

boxes

#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back		 
#define F first																 
#define S second 															 
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
#define endl "\n"
long long delivery(int n, int k, int l, int arr[]) {
    ll ans=0;
    if(k==1){
    	for(int i=0;i<n;i++){
    		ans+=min(arr[i],l-arr[i])*2;
		}
		return ans;
	}
	if(k==n){
		sort(arr,arr+n);
		ans=min({arr[n-1]*2,(l-arr[0])*2,l});
		return ans;
	}
	return 0;
}

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