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