| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 142825 | daniel920712 | 선물상자 (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 <stdio.h>
using namespace std;
long long delivery(int N, int K, int L, int p[])
{
long long ans=0;
int l=N+1,r=-1,i;
for(i=0;i<N;i++)
{
if(p[i]<=L/2)
{
if(p[i+1]>L/2||(i+1)%K==0||i+1==N)
{
ans+=p[i]*2;
//printf("%lld\n",ans);
}
}
else break;
}
for(i=N-1;i>=0;i--)
{
if(p[i]>L/2)
{
if(i==0||p[i-1]<=L/2||(N-i)%K==0)
{
ans+=(L-p[i])*2;
//printf("%lld\n",ans);
}
}
else break;
}
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... | ||||
