# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
409759 | radaiosm7 | Boxes with souvenirs (IOI15_boxes) | C++98 | 583 ms | 243528 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;
#include "boxes.h"
long long dp[2][10000005];
int n, i;
long long ans;
long long delivery(int n, int k, int l, int p[]) {
dp[0][0] = 0LL;
dp[1][n+1] = 0LL;
ans = LONG_LONG_MAX;
for (i=1; i <= n; ++i) {
dp[0][i] = 0LL;
dp[0][i] = dp[0][i-(i-k>=0)*k]+min(2LL*p[i-1], 1LL*l);
}
for (i=n; i >= 1; --i) {
dp[1][i] = 0LL;
dp[1][i] = dp[1][i+(i+k<=n)*k]+min(2LL*(l-p[i-1]), 1LL*l);
}
for (i=0; i <= n; ++i) {
ans = min(ans, dp[0][i]+dp[1][i+1]);
}
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... |