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
const int nx=105;
ll n, a, b, x, vl[nx], dp[nx][nx], msk, sm, p[40], m;
int main()
{
cin.tie(NULL)->sync_with_stdio(false);
cin>>n>>a>>b;
p[0]=1;
for (int i=1; i<40; i++) p[i]=p[i-1]*2;
m=p[38]-1;
for (int i=1; i<=n; i++) cin>>vl[i], sm|=vl[i];
dp[0][0]=1;
for (int x=37; x>=0; x--)
{
m-=p[x];
for (int i=1; i<=n; i++) for (int j=1; j<=n; j++) dp[i][j]=0;
for (int i=1; i<=n; i++)
{
for (int j=1; j<=n; j++)
{
msk=vl[i];
for (int k=i-1; k>=0; k--)
{
if ((msk|m)==m&&dp[k][j-1]) dp[i][j]|=1;
msk+=vl[k];
}
}
}
bool can=0;
for (int j=a; j<=b; j++) can|=dp[n][j];
if (!can) m+=(1<<x);
}
cout<<m;
}
# | 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... |