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;
using ll=long long;
const ll INF=1e18+5;
int main() {
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n, A, B;
cin >> n >> A >> B;
vector<ll> a(n);
for(int i=0; i<n; i++) {
cin >> a[i];
}
if(n<=20) {
ll rj=INF;
ll cur, sum;
for(int i=0; i<(1<<(n-1)); i++) {
cur=0;
if(__builtin_popcount(i)+1<A || __builtin_popcount(i)+1>B) {
continue;
}
sum=0;
for(int j=0; j<n-1; j++) {
sum+=a[j];
if(i&(1<<j)) {
cur|=sum;
sum=0;
}
}
sum+=a[n-1];
cur|=sum;
rj=min(rj, cur);
}
cout << rj << '\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... |