# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
129805 | DodgeBallMan | Boxes with souvenirs (IOI15_boxes) | C++14 | 2 ms | 376 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"
using namespace std;
const int N = 1e6 + 10;
long long ans, dpr[N], dpl[N];
int n, k, l, p[N];
long long delivery( int N, int K, int L, int P[] ) {
n = n, k = k, l = l;
for( int i = 1 ; i <= n ; i++ ) p[i] = P[i-1];
for( int i = 1 ; i <= n ; i++ ) dpr[i] = p[i] * 2 + dpr[max( 0, i - k )];
for( int i = n ; i >= 1 ; i-- ) dpl[i] = ( l - p[i] ) * 2 + dpl[min( l + 1, i + k )];
//for( int i = 1 ; i <= n ; i++ ) dpr[i] += dp[max( 0, i - k )];
//for( int i = n ; i >= 1 ; i-- ) dpl[i] += dp[min( l+1, i + k )];
for( int i = 0 ; i <= n ; i++ ) ans = min( ans, dpr[i] + dpl[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... |