#include <bits/stdc++.h>
#define int long long
#define pb push_back
#define F first
#define S second
#define B begin()
#define E end()
using namespace std;
int n,l,r;
int a[1001000];
int p[1000100];
int suf[1001000];
int dp[104][104][2004];
int sum(int i,int j)
{
return p[j]-p[i]+a[i];
}
int f(int i,int k,int x)
{
if(k==r)
{
return (x|suf[i]);
}
if(i==n-1)
return (x|a[i]);
if(dp[i][k][x]!=-1)
return dp[i][k][x];
int mn=1e17;
for(int j=i;j<n-1;j++)
{
mn=min(mn,f(j+1,k+1,(x|sum(i,j))));
}
return dp[i][k][x]=mn;
}
signed main()
{
memset(dp,-1,sizeof dp);
cin>>n>>l>>r;
l--;
r--;
for(int i=0;i<n;i++)
cin>>a[i];
p[0]=a[0];
for(int i=1;i<n;i++)
p[i]=p[i-1]+a[i];
suf[n-1]=a[n-1];
for(int i=n-2;i>=0;i--)
{
suf[i]=suf[i+1]+a[i];
}
int rr=r;
int mn=1e18;
for(int i=l;i<=rr;i++)
{
r=i;
mn=min(mn,f(0,0,0));
}
cout<<mn<<endl;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
66 ms |
169932 KB |
Output is correct |
2 |
Incorrect |
67 ms |
169852 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
69 ms |
169888 KB |
Output is correct |
2 |
Incorrect |
68 ms |
169956 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
68 ms |
169908 KB |
Output is correct |
2 |
Incorrect |
67 ms |
169980 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
66 ms |
169932 KB |
Output is correct |
2 |
Incorrect |
66 ms |
169856 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
68 ms |
169912 KB |
Output is correct |
2 |
Incorrect |
69 ms |
169944 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |