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;
typedef long long ll;
const int mxn = 30;
ll arr[mxn];
ll pre[mxn];
int main()
{
int n, a, b;
cin >> n;
cin >> a >> b;
for(int i = 0; i < n; i++) cin >> arr[i];
pre[0] = arr[0];
for(int i = 1; i < n; i++) pre[i] = arr[i]+pre[i-1];
ll lim = (1<<n)-1;
ll res = 4e18;
for(int i = 0; i < lim; i++)
{
int cnt = __builtin_popcount(i)+1;
if(cnt<a || cnt>b) continue;
ll ans = 0, last = -1;
for(int r = 0; r < n; r++)
{
ll sum = 0;
if(r&(1<<i) || r==n-1)
{
if(last==-1) sum = pre[r];
else sum = pre[r]-pre[last];
last = r;
ans = ans|sum;
}
}
res = min(res, ans);
}
cout << res << '\n';
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... |