# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
134544 | 20160161simone | Boxes with souvenirs (IOI15_boxes) | C++14 | 2 ms | 380 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[])
{
if(K==1)
{
long long ans=0;
for(int i=0;i<N;i++) ans+=min(abs(L-p[i]),abs(p[i]))*2;
return ans;
}
if(K==N)
{
int flagr=0,flagl=0;
for(int i=0;i<N;i++)
{
if(abs(L-p[i])>abs(p[i])) flagr=1;
else flagl=1;
if(flagr==1&&flagl==1) break;
}
if(flagr==1&&flagl==1) return L;
else
{
long long ans=0;
for(int i=0;i<N;i++)
{
ans=max(ans,((long long)min(abs(L-p[i]),abs(p[i]))*2));
}
return ans;
}
}
}
Compilation message (stderr)
# | 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... |