Submission #54453

#	Time	Username	Problem	Language	Result	Execution time	Memory
54453		MoNsTeR_CuBe	Boxes with souvenirs (IOI15_boxes)	C++17	20 / 100	2 ms	380 KiB

boxes

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

long long delivery(int N, int K, int L, int p[]) {
    if(K == 1){
        long long tot = 0;
        for(int i = 0; i < N; i++){
            long long cost = min(p[i], L-p[i]);
            tot+=(cost*2);
        }
        return tot;
    }else if(K == N){
        sort(p, p+N);
        int mid = L/2;
        int sum = 0;
        for(int i = 0; i < N; i++){
            if(p[i] <= mid){
                sum = p[i]*2;
            }else if(p[i] > mid){
                sum+=((L-p[i])*2);
                break;
            }
        }
        return min(sum, L);
    }

}
/*
int main(){
    int N, K, L;
    cin >> N >> K >> L;
    int tab[N];
    for(int i = 0; i < N; i++){
        cin >> tab[i];
    }
    cout << delivery(N,K,L,tab) << endl;
}
*/

Compilation message (stderr)

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:28:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

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