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;
int n,a,b;
int arr[55];
int dp[55][600][22];
int main(){
cin>>n>>a>>b;
for(int i=1;i<=n;i++){
cin>>arr[i];
}
dp[0][0][0] = 1;
for(int i=1;i<=n;i++){
for(int k=1;k<=b;k++){
int sum = 0;
for(int j=i;j>=1;j--){
sum += arr[j];
for(int h=0;h<=511;h++){
if(dp[j-1][h][k-1]==0)continue;
dp[i][h|sum][k] = 1;
}
}
}
}
int ans = 1000000009;
for(int i=a;i<=b;i++){
for(int j=0;j<=511;j++){
if(dp[n][j][i])ans = min(ans,j);
}
}
cout<<ans<<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... |