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>
#include <algorithm>
#include <vector>
#include <set>
using namespace std;
const long long INF = 1e15;
const int MAX = 70;
int main() {
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n, a, b;
cin >> n >> a >> b;
vector<long long> x(n + 1);
for (int i = 1; i <= n; i++) {
cin >> x[i];
}
vector<vector<set<long long>>> d(b + 1, vector<set<long long>>(n + 1));
d[0][0].insert(0);
for (int j = 1; j <= b; j++) {
for (int i = 1; i <= n; i++) {
long long cur = x[i];
for (int k = i - 1; k >= 0; k--) {
for (auto &x : d[j - 1][k]) {
d[j][i].insert(cur | x);
}
while (d[j][i].size() > MAX) {
d[j][i].erase(--d[j][i].end());
}
cur += x[k];
}
}
}
long long ans = INF;
for (int i = a; i <= b; i++) {
ans = min(ans, *d[i][n].begin());
}
cout << ans << endl;
// system("pause");
}
# | 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... |