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;
#define int long long
bool DP[101][101];
int arr[101];
int a,b,n;
bool test(int k){
for(auto&i:DP)for(auto&j:i)j=false;
DP[0][0]=true;
for(int j=1;j<=b;j++){
for(int i=j;i<=n;i++){
int sum = arr[i];
for(int x=i-1;x>=j-1;x--){
if((sum|k) == k and DP[x][j-1]){DP[i][j]=true;break;}
sum+=arr[x];
}
}
}
for(int i=a;i<=b;i++)if(DP[n][i])return true;
return false;
}
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n >> a >> b;
for(int i=1;i<=n;i++)cin>>arr[i];
for(int i=0;i<=2000;i++)if(test(i)){
cout << i << '\n';
return 0;
}
}
# | 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... |