# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
154129 | arnold518 | Boxes with souvenirs (IOI15_boxes) | C++14 | 616 ms | 241812 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;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 2e7;
int N, K, L, P[MAXN+10];
ll A[MAXN+10], B[MAXN+10], ans=1e18;
ll delivery(int _N, int _K, int _L, int *_P)
{
int i, j;
N=_N; K=_K; L=_L;
for(i=1; i<=N; i++) P[i]=_P[i-1]+1;
for(i=1; i<=N; i++) A[i]=A[max(0, i-K)]+P[i]-1+min(P[i]-1, L-P[i]+1);
for(i=N; i>=1; i--) B[i]=B[min(N+1, i+K)]+L-P[i]+1+min(P[i]-1, L-P[i]+1);
ans=min(A[N], B[1]);
for(i=1; i<N; i++) ans=min(ans, A[i]+B[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... |