제출 #1218453

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1218453		LIA	Boxes with souvenirs (IOI15_boxes)	C++17	10 / 100	0 ms	328 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef tuple <ll,ll,ll> plll;
typedef vector <plll> vplll;
typedef pair <ll,ll> pll;
typedef vector <ll> vll;
typedef vector <pll> vpll;
typedef vector <vector <pll>> vvpll;
typedef vector <vector <ll>> vvll;
typedef vector <bool> vb;
typedef vector <vector <bool>> vvb;
#define loop(i, s, e) for (ll i = (s); i < (e); ++i)
#define loopr(i, e, s) for (ll i = (e)-1; i >= (s); --i)
#define all(a) a.begin(), a.end()
const ll inf = 1e9 + 7;
ll n,k,l;
vll p;
long long delivery(int N, int K, int L, int P[]) {
    n=N,k=K,l=L;
    p.resize(n);
    loop(i,0,n) p[i] = P[i];
    sort(all(p));
    p.push_back(p[0]);
    ll maxi =  *max_element(all(p));
    ll mini =  *min_element(all(p));
    ll ans = min({l, maxi*2, (l-mini)*2}) ;
    loop(i,0,n) {
        ll a = p [i], b = p[i+1];
        ans = min(ans, (a*2 + (l-b)*2));
    }
    return ans;
}

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