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
int const N=105;
int const inf=1e13;
bool dp[N][N];
int dp2[N];
int arr[N];
int n,A,B;
bool check(int MX){
for (int i = 0; i <=n; ++i)
for (int j = 0; j <=n; ++j)
dp[i][j]=0;
dp[0][0]=1;
for(int i=1;i<=n;i++)
for(int k=1;k<=i;k++){
int sm=0;
for(int j=i;j>=1;j--){
sm+=arr[j];
if(dp[j-1][k-1] && ((MX|sm)==MX))
dp[i][k]=1;
}
}
for(int k=A;k<=B;k++)
if(dp[n][k])
return 1;
return 0;
}
bool check2(int MX){
for (int i = 0; i <=n; ++i)
dp2[i]=inf;
dp2[0]=0;
for(int i=1;i<=n;i++){
int sm=0;
for(int j=i;j>=1;j--){
sm+=arr[j];
if((MX|sm)==MX)
dp2[i]=min(dp2[i],dp2[j-1]+1);
}
}
if(dp2[n]<=B)
return 1;
return 0;
}
signed main(){
cin>>n>>A>>B;
for (int i = 1; i <=n; ++i)
cin>>arr[i];
if(n>100){
int one=1;
int ans=(one<<44)-1;
for(int b=43;b>=0;b--)
if(check2(ans-(one<<b)))
ans-=(one<<b);
cout<<ans<<endl;
return 0;
}
int one=1;
int ans=(one<<44)-1;
for(int b=43;b>=0;b--)
if(check(ans-(one<<b)))
ans-=(one<<b);
cout<<ans<<endl;
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... |