Submission #1155190

#	Time	Username	Problem	Language	Result	Execution time	Memory
1155190		aarb_.tomatexd	선물상자 (IOI15_boxes)	C++20	10 / 100	0 ms	328 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long

ll delivery(int N, int K, int L, int positions[]) {
    
    ll time = 0;
    int k = K, l = L;
    vector<int> pos(N);
    for (int i = 0; i < N; i++) {
        pos[i] = positions[i];
    }
    if(k==1){
        for (int i = N - 1; i >= 0; i -= K) {
            time += 2 * min(pos[i], l-pos[i]); 
        }
        return time;
    }else if(k==N){
        //la mas lejana
        int mn = min(pos[N-1], L -pos[0]);
        return mn;
    }
    return 0;
}
/*
int main() {
    int positions[] = {1, 2, 7}; // Definir el array correctamente
    cout << delivery(3, 3, 8, positions);
    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