# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
640209 | ymm | Boxes with souvenirs (IOI15_boxes) | C++17 | 1 ms | 300 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>
#define Loop(x,l,r) for (ll x = (l); x < (r); ++x)
#define LoopR(x,l,r) for (ll x = (r)-1; x >= (l); --x)
typedef long long ll;
typedef std::pair<int, int> pii;
typedef std::pair<ll , ll > pll;
using namespace std;
static vector<int> a, b;
static ll calc(vector<int> &v, int st, int k)
{
ll ans = 0;
for (int i = st; i < v.size(); i += k) {
ans += v[i];
ans += v[i];
}
return ans;
}
long long delivery(int N, int K, int L, int p[])
{
Loop (i,0,N) {
if (p[i] < L-p[i])
a.push_back(p[i]);
else
b.push_back(L-p[i]);
}
reverse(a.begin(), a.end());
ll ans = calc(a, 0, K) + calc(b, 0, K);
Loop (i,1,K)
ans = min(ans, calc(a, i, K) + calc(b, K-i, K) + L + L);
return ans;
}
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... |