| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 673726 | Hacv16 | Boxes with souvenirs (IOI15_boxes) | C++17 | 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<bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
typedef long long ll;
ll getDist(ll x, ll y, ll l){
if(y > x) swap(x, y);
return min(x - y, l - x + y);
}
ll delivery(ll n, ll k, ll l, ll p[]){
ll ans = 0;
if(k == 1){
for(int i = 0; i < n; i++)
ans += getDist(0, p[i], l);
}else if(k == n){
ans = INF;
ll mn = p[0], mx = p[n - 1];
ans = min(ans, getDist(0, mx, l) + getDist(mx, mn, l) + getDist(mn, 0, l));
ans = min(ans, getDist(0, mn, l) + getDist(mn, mx, l) + getDist(mx, 0, l));
}
return ans;
}