Submission #826999

#	Time	Username	Problem	Language	Result	Execution time	Memory
826999		Supersonic	Boxes with souvenirs (IOI15_boxes)	C++14	10 / 100	1 ms	308 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
long long delivery(int n, int k, int l, int p[]) {
    if(k==1){
        ll t=0;
        for(int i=0;i<n;i++){
            //t+=p[i];
            t+=2*min(p[i],l-p[i]);
        }
        return t;
    }
    if(k==n){
        int a=0,b=0;
        for(int i=0;i<n;i++){
            if(p[i]<=l/2)a=max(p[i],a);
            else b=max(p[i],b);
        }
        return min(2*(a+b),l);
    }
    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