Submission #1210638

#TimeUsernameProblemLanguageResultExecution timeMemory
1210638m5588ohammedBoxes with souvenirs (IOI15_boxes)C++20
10 / 100
0 ms328 KiB
#include "boxes.h" #include <bits/stdc++.h> using namespace std; int n,k,l; long long dp[10000001],dp2[10000001]; long long delivery(int N, int K, int L, int p[]) { n=N,k=K,l=L; sort(p,p+n); for(int i=0;i<n;i++){ dp[i]=p[i]*2; if(i>=k) dp[i]+=dp[i-k]; } for(int i=n-1;i>=0;i--){ dp2[i]=(l-p[i])*2; if(i+k<n) dp2[i]+=dp2[i+k]; } long long ans=1e18;; for(int i=0;i<n-1;i++){ ans=min(ans,dp[i]+dp2[i+1]); } // cout<<"YESs :"; // for(int i=0;i<n;i++) cout<<dp[i]<<" "; // cout<<endl; // cout<<"YES :"; // for(int i=0;i<n;i++) cout<<dp2[i]<<" "; // cout<<endl; ans=min(ans,dp[n-1]); return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...