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 int64_t ll;
typedef string str;
const int N = 2e3 + 1;
const ll inf = 1e18;
ll y[N];
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, a, b;
cin >> n >> a >> b;
for (int i = 0; i < n; ++i) {
cin >> y[i];
}
ll ans = inf;
for (int mask = 0; mask < (1 << (n - 1)); ++mask) {
int cnt = __builtin_popcount(mask) + 1;
if (cnt < a || cnt > b) {
continue;
}
ll cur = 0;
ll sum = y[0];
for (int bit = 0; bit < n - 1; ++bit) {
if (mask & (1 << bit)) {
cur |= sum;
sum = y[bit + 1];
} else {
sum += y[bit + 1];
}
}
cur |= sum;
ans = min(ans, cur);
}
cout << ans;
}
# | 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... |