# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
693910 | T0p_ | Boxes with souvenirs (IOI15_boxes) | C++14 | 0 ms | 0 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>
using namespace std;
long long cost(int a, int b, int L)
{
if (a > b) swap(a, b);
return min(b-a, L-b+a);
}
long long delivery(int N, int K, int L, int p[])
{
long long ans = 0;
int pos = 0;
for (int i=0 ; i<N ; i++)
{
ans = += cost(pos, p[i], L);
pos = p[i];
}
return ans + cost(pos, 0, L);
}