# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
152580 | beso123 | Bali Sculptures (APIO15_sculpture) | C++14 | 2 ms | 380 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>
#define int long long
using namespace std;
int n,A,B,a[2002],dp[2002][2002],pref[2002];
vector <int> v;
main(){
cin>>n>>A>>B;
for(int k=1;k<=n;k++){
cin>>a[k];
pref[k]=pref[k-1]+a[k];
v.push_back(pref[k]);
}
int ans=pref[n];
for(int k=1;k<=n;k++)
dp[1][k]=pref[k];
for(int k=2;k<=B;k++){
for(int i=k;i<=n;i++){
int h=pref[i]/k;
vector <int>::iterator it=lower_bound(v.begin(),v.end(),pref[i]-h);
int p=distance(v.begin(),it);
while(v[p]==pref[i]-h)
p++;
p++;
int h1=dp[k-1][p-1] | (pref[i]-pref[p-1]);
dp[k][i]=h1;
}
ans=min(ans,dp[k][n]);
}
/* for(int k=1;k<=B;k++){
for(int i=1;i<=n;i++){
cout<<dp[k][i]<<' ';
}
cout<<endl;
}*/
cout<<ans;
return 0;
}
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... |