제출 #685125

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
685125		APROHACK	선물상자 (IOI15_boxes)	C++14	20 / 100	1 ms	312 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
#define pb push_back
using namespace std;
ll n, k, l;
vector<int>teams;
ll distanciaABase(ll number){
    return min(number, l-number);
}
bool isLeft(int number){
    return number <= l/2;
}

long long delivery(int N, int K, int L, int p[]) {
    n = N, k = K, l = L;
    ll ans = 0;
    ll mx = 0, mxL = 0, mxR = 0;
    for(int i = 0 ; i < n ; i ++){
        teams.pb(p[i]);
        if(k == 1)ans +=distanciaABase(p[i])*2;
        else{
            if(isLeft(p[i])){
                mxL = max(distanciaABase((p[i]))*2, mxL);
            }else{
                mxR = max(distanciaABase((p[i]))*2, mxR);
            }
        }

        mx = max(distanciaABase(p[i])*2, mx);
    }
    if(k == 1)return ans;
    else return min (l, mxL + mxR);
}

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