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;
void solve() {
int n, a, b;
cin >> n >> a >> b;
vector<int>v(n + 1);
for(int i = 1; i <= n; i++) {
cin >> v[i];
}
long long ans = 1e18;
for(int i = 0; i < (1 << n); i++) {
long long g = 0, sum = 0;
for(int j = 0; j < n; j++) {
sum += v[j + 1];
if(i & (1 << j)) {
g |= sum;
sum = 0;
}
}
g |= sum;
//cout << i << ": " << g << '\n';
int bits = __builtin_popcount(i) + 1;
if(a <= bits && bits <= b) ans = min(ans, g);
}
cout << ans;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int t = 1;
//cin >> t;
while(t--) {
solve();
}
}
/*
6 1 3
8 1 2 1 5 4
*/
# | 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... |