Submission #284733

#TimeUsernameProblemLanguageResultExecution timeMemory
284733JoseCopasBoxes with souvenirs (IOI15_boxes)C++17
10 / 100
1 ms384 KiB
#include "boxes.h"

#include "bits/stdc++.h"

using namespace std;

long long delivery(int N, int K, int L, int p[])
{
    long long c=0;
    if(K==1)
    {
        sort(p, p+N);
        for(int i=0;i<N;i++)
        {
            c+=2*min(L-p[i], p[i]);
        }
    }
    else if(K==N)
    {
        long long a=0,b=0;
        a+=p[0];
        b+=L-p[N-1];
        for(int i=N-1;i>0;i--)
        {
            //cout<<p[i]<<"\n";
            b+=(p[i] - p[i-1]);
        }
        for(int i=1;i<N;i++)
        {
            a+=p[i]-p[i-1];
        }
        a+=min(p[N-1], L - p[N-1]);
        b+=min(p[0], L - p[0]);
       // cout<<a<<" "<<b<<"\n";
        c = min(a,b);
    }
    return c;
}
/*
int main()
{
    int n,k,l;
    cin>>n>>k>>l;
    int v[n];
    for(int i=0;i<n;i++)cin>>v[i];
    cout<<delivery(n,k,l,v)<<"\n";

}
*/
#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...