Submission #467758

#TimeUsernameProblemLanguageResultExecution timeMemory
467758Carmel_Ab1Boxes with souvenirs (IOI15_boxes)C++17
10 / 100
1 ms304 KiB
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll>vl;
#include "boxes.h"

//#include "grader.cpp"
ll dst(ll x,ll y,ll l){
    return min(abs(x-y),x+abs(l-1-y)+1);
}
ll delivery(int N, int K, int L, int P[]) {
    ll n=N,k=K,l=L;
    vl p(n);
    for(int i=0; i<n; i++)
        p[i]=P[i];
    if(k==1){
        ll ans=0;
        for(int i=0; i<n; i++)
            ans+=2*dst(0,p[i],l);
        return ans;
    }
    else if(k==n){
        ll ans=min({2 * p.back(), l, 2 * (l - p[0])});
        return ans;
    }
    return -1;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...