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>
using namespace std;
const int N=55,B=22,O=522,MX=1e9+9;
int n,x,y,a[N],pre[N],dp[N][O][B];
int solve(int pos,int OR,int parts){
if(pos==n+1)
return (parts>=x && parts<=y?OR:MX);
int &ret=dp[pos][OR][parts];
if(ret!=-1)
return ret;
ret=MX;
for(int i=pos;i<=n;i++)
ret=min(ret,solve(i+1,OR|(pre[i]-pre[pos-1]),parts+1));
return ret;
}
int main(){
cin>>n>>x>>y;
for(int i=1;i<=n;i++)
cin>>a[i],pre[i]=a[i]+pre[i-1];
memset(dp,-1,sizeof(dp));
cout<<solve(1,0,0)<<endl;
}
# | 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... |