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 <iostream>
using namespace std;
using ll = long long;
const int MAXN = 2077;
const ll INF = 1.77013e18;
ll a[MAXN];
signed main() {
int n, A, B;
cin >> n >> A >> B;
for (int i = 0; i < n; ++i)
cin >> a[i];
ll ans = INF;
for (int m = (1 << n) / 2; m < (1 << n); ++m) {
ll cnt = __builtin_popcount(m);
if (A <= cnt && cnt <= B)
continue;
ll sm = 0;
ll ans_ = 0;
for (int i = 0; i < n; ++i) {
sm += a[i];
if (m & (1 << i)) {
ans_ |= sm;
sm = 0;
}
}
ans = min(ans, ans_);
}
cout << ans << endl;
}
# | 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... |