제출 #430563

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

boxes

#include "boxes.h"

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
#define pb push_back
#define ff first
#define ss second

ll n, k, l;
vector <ll> arr;

ll delivery(int N, int K, int L, int p[]) {
    // Cambia la entrada
    n = (ll)N;
    k = (ll)K;
    l = (ll)L;
    arr.resize(n);
    ll cnt = l;
    for (int i=0; i<n; i++) arr[i] = (ll)p[i];

    for (int i=0; i<n; i++) {
        //cout << "Llendo hasta el elemento " << i << " en " << arr[i] << ", y al elemento " << i+1 << ", en " << arr[i+1] <<  " desde la derecha." << endl;
        //cout << "cnt = " << cnt << endl;
        cnt = min(cnt, arr[i] + (i+1 == n ? 0 : l-arr[i+1]));
    }

    return cnt*2LL;
}

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