# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
134539 | 20160161simone | Boxes with souvenirs (IOI15_boxes) | C++14 | 2 ms | 376 KiB |
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>
#define M 100000010
using namespace std;
int mi[M];
long long delivery(int N, int K, int L, int p[])
{
for(int i=0;i<N;i++){
mi[i]=min(abs(L-p[i]),abs(p[i]))*2;
}
sort(mi+1,mi+1+N);
int ans=0,val=0,k=0;
for(int i=1;i<=N;i++)
{
k++;
val=max(mi[i],val);
if(k==K)
{
ans+=val;
val=0;
k=0;
}
}
ans+=val;
return ans;
}
# | 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... |