# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
427647 | Dan4Life | Boxes with souvenirs (IOI15_boxes) | C++17 | 2086 ms | 276 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;
#define ll long long
ll delivery(int n, int k, int l, int a[])
{
if(n<=10 or k==n)
{
ll ans = 100000000000;
vector<int> v; v.clear();
for(int i = 0; i < n; i++) v.push_back(a[i]);
do
{
ll sum = 0; int cur = 0;
for(int i = 0; i < n; i++)
{
sum+=min(abs(cur-v[i]), l-abs(cur-v[i]));
cur = v[i];
if(i%k==k-1) sum+=min(cur, l-cur), cur = 0;
}
sum+=min(cur, l-cur);
//cout << sum << " ";
ans = min(ans, sum);
}while(next_permutation(v.begin(), v.end()));
return ans;
}
else if(k==1){
ll ans = 0;
for(int i = 0; i < n; i++) ans+=min((ll)a[i], (ll)l-a[i]);
return ans*2;
}
else if(k==n){
}
else{
}
}
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... |