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 try ico
#define ll long long
const ll MAXN=2048;
ll y[MAXN],n,a,b;
bool dp[MAXN][MAXN];
bool try(ll mask)
{
memset(dp,0,sizeof(dp));
dp[1][0]=1;
for(int i=1;i<=n;i++)
{
ll sum=0;
for(int j=i;j<=n;j++)
{
sum+=y[j];
if((mask&sum)==sum&&(mask|sum)==mask)
{
for(int l=0;l<=n;l++)
{
dp[j+1][l+1]|=dp[i][l];
}
}
}
}
for(ll i=a;i<=b;i++)
{
if(dp[n+1][i])
{
return 1;
}
}
return 0;
}
int main()
{
cin>>n>>a>>b;
for(int i=1;i<=n;i++)
{
cin>>y[i];
}
ll mask=(1ll<<60)-1;
for(ll i=59;i>=0;i--)
{
if(try(mask-(1ll<<i)))
{
mask-=(1ll<<i);
}
}
cout<<mask<<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... |