| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 142824 | daniel920712 | Boxes with souvenirs (IOI15_boxes) | C++14 | 2 ms | 256 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=1;K*i-1<N&&p[K*i-1]<=N/2;i++)
{
ans+=(long long) (p[K*i-1]*2);
r=K*i-1;
//printf("a %d %d\n",i,p[K*i-1]);
}
for(i=1;N-K*i>=0&&p[N-K*i]>N/2;i++)
{
ans+=(long long) ((L-p[N-K*i])*2);
l=N-K*i;
//printf("b %d %d\n",i,p[N-K*i]);
}
if(r<l) ans+=N;
//printf("%d %d\n",l,r);
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... | ||||
