Submission #588541

#	Time	Username	Problem	Language	Result	Execution time	Memory
588541		Siffer	Boxes with souvenirs (IOI15_boxes)	C++14	20 / 100	1 ms	300 KiB

boxes

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

typedef long long ll;

ll delivery(int N, int K, int L, int p[]) {
        ll r = 0;
        if(K==1) {
                for(int i = 0; i < N; i++) r += min(p[i], L-p[i])<<1;
        } else {
                ll m = 0, mm = 0;
                for(int i = 0; i < N; i++) {
                        if(p[i] <= (L>>1)) m = max(p[i]+0ll, m);
                        else mm = max(L-p[i]+0ll,mm);
                }
                r = min(L+0ll, mm+mm+m+m);
        }
        return r;
}

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