This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "boxes.h"
#include<bits/stdc++.h>
using namespace std;
long long i, n, k, l, A[1000010];
long long delivery(int N, int K, int L, int p[])
{
n=N;k=K;l=L;
for(i=0;i<n;i++)A[i]=p[i];
if(k==1)
{
long long ans=0;
for(i=0;i<n;i++)
{
ans+=(min(A[i], l-A[i])*2);
}
return ans;
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |