# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
128267 | 2019-07-10T15:43:09 Z | zeyad49 | Boxes with souvenirs (IOI15_boxes) | C++17 | 0 ms | 0 KB |
#include <bits/stdc++.h> using namespace std; const int N=1000; const long long INF=(long)1e18; int K,L; int memo[N][N]; int teams[N]; long long dist[N][N]; long long dp(int l,int r) { if(l>r) return 0; if(memo[l][r]!=-1) return memo[l][r]; long long ans=K>=r-l+1?L:INF; int last; last=min(r,l+K-1); for(int k=l;k<=last;k++){ ans=min(ans,2*teams[k]+dp(k+1,r)); } last=max(l,r-k+1); for(int k=r;k>=last;k--){ ans=min(ans,2*(L-teams[k])+dp(l,k-1)); } return memo[l][r]=ans; } long long delivery(int a, int b, int c, int x[]) { K=b; L=c; sort(x,x+a); for(int i=0;i<a;i++){ teams[i]=x[i]; for(int j=0;j<a;j++) memo[i][j]=-1; } return dp(0,a-1); }