Submission #1077505

#	Time	Username	Problem	Language	Result	Execution time	Memory
1077505		mariza	선물상자 (IOI15_boxes)	C++14	20 / 100	1 ms	444 KiB

boxes

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

typedef long long ll;

long long delivery(int N, int K, int L, int p[]) {
    if(K==1){
        ll ans=0;
        for(ll i=0; i<N; i++){
            ans+=min(2*p[i],2*(L-p[i]));
        }
        return ans;
    }
    else{
        ll x=0, y=L;
        for(ll i=0; i<N; i++){
            if(p[i]<=L/2) x=max(x,(ll)p[i]);
            else y=min(y,(ll)p[i]);
        }
        return min((ll)L,2*x+2*(L-y));
    }
}

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