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;
#define int ll
const int INF = 1e18;
void run() {
int n, a, b;
cin >> n >> a >> b;
vector<int> y(n);
for (auto &x : y)
cin >> x;
int ans = INF;
for (int mask = 0; mask < (1 << n); ++mask) {
int cnt = __builtin_popcountll(mask) + 1;
if (cnt < a || cnt > b)
continue;
int cur_ans = 0;
int cur_sum = 0;
for (int i = 0; i < n; ++i) {
if (mask & (1 << i)) {
cur_ans |= cur_sum;
cur_sum = 0;
}
cur_sum += y[i];
}
cur_ans |= cur_sum;
if (cur_ans < ans)
ans = cur_ans;
}
cout << ans << '\n';
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
run();
}
# | 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... |