Submission #685120

#	Time	Username	Problem	Language	Result	Execution time	Memory
685120		APROHACK	선물상자 (IOI15_boxes)	C++14	10 / 100	1 ms	308 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;
int n, k, l;
vector<int>teams;
ll distanciaABase(int 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;
    bool left = false, right = false;
    for(int i = 0 ; i < n ; i ++){
        teams.pb(p[i]);
        if(k == 1)ans +=distanciaABase(p[i])*2;
        else if(isLeft(p[i]))left = true;
        else right = true;
        mx = max(distanciaABase(p[i])*2, mx);
    }
    if(k == 1)return ans;
    else if(left and right)return l;
    else return mx ;
}

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