#include <bits/stdc++.h>
using namespace std;
#define ll long long
//14:20
int n;
ll m;
ll c[45];
ll way[1050000];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> m;
for(int i = 0; i < n; i++) {
cin >> c[i];
}
if(n <= 21) {
ll ways = 0;
for(int mask = 0; mask < (1<<n); mask++) {
ll money = m;
for(int i = 0; i < n; i++) {
if(mask&(1<<i)) {
money-= c[i];
}
}
if(money >= 0) {
ways++;
}
}
cout << ways;
} else {
ll ways = 0;
set<ll> did;
map<ll,int> compr;
for(int mask = 0; mask < (1<<20); mask++) {
ll money = m;
for(int i = 0; i < 20; i++) {
if(mask&(1<<i)) {
money-= c[i];
}
}
if(money >= 0) {
did.insert(m-money);
}
}
int in = 1;
for(ll el : did) {
compr[el] = in++;
}
for(int mask = 0; mask < (1<<20); mask++) {
ll money = m;
for(int i = 0; i < 20; i++) {
if(mask&(1<<i)) {
money-= c[i];
}
}
if(money >= 0) {
way[compr[(m-money)]]++;
}
}
for(int i = 1; i <= in; i++) {
way[i]+=way[i-1];
}
for(int mask = 0; mask < (1<<(n-20)); mask++) {
ll money = m;
for(int i = 20; i < n; i++) {
if(mask&(1<<(i-20))) {
money-= c[i];
}
}
if(money >= 0) {
auto it = did.upper_bound(money);
if(it != did.begin()) {
it--;
ways+= way[compr[*it]];
}
}
}
cout << ways;
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
376 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
456 KB |
Output is correct |
2 |
Correct |
2 ms |
476 KB |
Output is correct |
3 |
Correct |
3 ms |
476 KB |
Output is correct |
4 |
Correct |
2 ms |
552 KB |
Output is correct |
5 |
Correct |
2 ms |
600 KB |
Output is correct |
6 |
Correct |
2 ms |
600 KB |
Output is correct |
7 |
Correct |
2 ms |
600 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
12 ms |
600 KB |
Output is correct |
2 |
Correct |
7 ms |
600 KB |
Output is correct |
3 |
Correct |
14 ms |
620 KB |
Output is correct |
4 |
Correct |
2 ms |
620 KB |
Output is correct |
5 |
Correct |
7 ms |
620 KB |
Output is correct |
6 |
Correct |
94 ms |
620 KB |
Output is correct |
7 |
Correct |
12 ms |
640 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
89 ms |
640 KB |
Output is correct |
2 |
Correct |
22 ms |
640 KB |
Output is correct |
3 |
Correct |
7 ms |
640 KB |
Output is correct |
4 |
Correct |
7 ms |
640 KB |
Output is correct |
5 |
Correct |
92 ms |
644 KB |
Output is correct |
6 |
Correct |
13 ms |
644 KB |
Output is correct |
7 |
Correct |
13 ms |
644 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
609 ms |
2704 KB |
Output is correct |
2 |
Execution timed out |
1082 ms |
39348 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
713 ms |
39348 KB |
Output is correct |
2 |
Execution timed out |
1084 ms |
39348 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1092 ms |
39348 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1077 ms |
44596 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1072 ms |
44596 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1082 ms |
44596 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |