#include <iostream>
using namespace std;
#define int long long
#define pc __builtin_popcount
const int N = 21, inf = 1073741824;
int n, a, b, ans = inf, ar[N], dp[1 << 20];
void calc(int mask) {
if(pc(mask) + 1 > b) {
return;
}
if(a <= pc(mask) + 1 && pc(mask) + 1 <= b) {
if(dp[mask] == -1) {
int sum = 0, temp = 0;
for(int i = 0; i < n; i++) {
sum += ar[i];
if(mask & (1 << i)) {
temp |= sum;
sum = 0;
}
}
temp |= sum;
dp[mask] = temp;
}
ans = min(ans, dp[mask]);
}
if(pc(mask) + 1 == b) {
return;
}
for(int i = 0; i < n; i++) {
if(mask >> i & 1); else {
calc(1 << i | mask);
}
}
}
main() {
cin >> n >> a >> b;
for(int i = 0; i < (1 << 20); i++) {
dp[i] = -1;
}
for(int i = 0; i < n; i++) {
cin >> ar[i];
}
calc(0);
cout << ans << endl;
}
Compilation message
sculpture.cpp:44:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
main() {
^
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
10 ms |
8576 KB |
Output is correct |
2 |
Correct |
11 ms |
8576 KB |
Output is correct |
3 |
Correct |
9 ms |
8576 KB |
Output is correct |
4 |
Correct |
10 ms |
8448 KB |
Output is correct |
5 |
Correct |
12 ms |
8600 KB |
Output is correct |
6 |
Execution timed out |
1078 ms |
8448 KB |
Time limit exceeded |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
10 ms |
8576 KB |
Output is correct |
2 |
Correct |
10 ms |
8576 KB |
Output is correct |
3 |
Correct |
10 ms |
8576 KB |
Output is correct |
4 |
Correct |
9 ms |
8576 KB |
Output is correct |
5 |
Correct |
11 ms |
8576 KB |
Output is correct |
6 |
Execution timed out |
1031 ms |
8576 KB |
Time limit exceeded |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
9 ms |
8576 KB |
Output is correct |
2 |
Correct |
10 ms |
8576 KB |
Output is correct |
3 |
Correct |
9 ms |
8576 KB |
Output is correct |
4 |
Correct |
9 ms |
8448 KB |
Output is correct |
5 |
Correct |
10 ms |
8576 KB |
Output is correct |
6 |
Execution timed out |
1068 ms |
8576 KB |
Time limit exceeded |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
10 ms |
8576 KB |
Output is correct |
2 |
Correct |
9 ms |
8520 KB |
Output is correct |
3 |
Correct |
9 ms |
8576 KB |
Output is correct |
4 |
Correct |
10 ms |
8576 KB |
Output is correct |
5 |
Correct |
11 ms |
8576 KB |
Output is correct |
6 |
Execution timed out |
1091 ms |
8576 KB |
Time limit exceeded |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
9 ms |
8448 KB |
Output is correct |
2 |
Correct |
8 ms |
8448 KB |
Output is correct |
3 |
Correct |
9 ms |
8576 KB |
Output is correct |
4 |
Correct |
11 ms |
8576 KB |
Output is correct |
5 |
Correct |
10 ms |
8576 KB |
Output is correct |
6 |
Execution timed out |
1068 ms |
8576 KB |
Time limit exceeded |
7 |
Halted |
0 ms |
0 KB |
- |