| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 489230 | ssense | 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 <bits/stdc++.h>
#include "boxes.h"
#define startt ios_base::sync_with_stdio(false);cin.tie(0);
typedef long long ll;
using namespace std;
#define vint vector<int>
#define all(v) v.begin(), v.end()
#define MOD 1000000007
#define MOD2 998244353
#define MX 1000000000
#define MXL 1000000000000000000
#define PI (ld)2*acos(0.0)
#define nax 200005
#define pb push_back
#define sc second
#define fr first
//#define int unsigned long long
//#define endl '\n'
#define ld long double
#define NO cout << "NO" << endl
#define YES cout << "YES" << endl
long long delivery(int n, int k, ll l, ll pos[])
{
ll ans = 0;
ll mx = 0, mn = l;
for(int i = 0; i < n; i++)
{
ans+=min(pos[i], l-pos[i])*2;
mx = max(mx, pos[i]);
if(pos[i] != 0)
{
mn = min(mn, pos[i]);
}
}
if(k == n && k != 1)
{
return min({(l-mn)*2LL, mx*2LL, l});
}
return ans;
}