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 ll long long
ll n,a,b,c,qs[2005],dp[2005],cnt;
ll query(ll l,ll r)
{
return qs[r]-qs[l-1];
}
int main()
{
ios_base::sync_with_stdio(0),cin.tie(0);
cin >> n >> a >> b;
for(int i=1;i<=n;i++)
{
cin >> c;
qs[i]=qs[i-1]+c;
}
if(a==1)
{
cnt=0;
for(int i=60;i>=0;i--)
{
cnt|=(1ll<<i);
for(int j=1;j<=n;j++)dp[j]=1e9;
dp[0]=0;
for(int j=1;j<=n;j++)
{
for(int k=0;k<j;k++)
{
if((query(k+1,j)&cnt)==0)
{
dp[j]=min(dp[j],dp[k]+1);
}
}
}
if(dp[n]>b)cnt^=(1ll<<i);
}
printf("%lld\n",(((1ll<<61)-1ll)^cnt));
}else
{
}
}
# | 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... |