이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
//In the name of Allah
//SMani24
#include<bits/stdc++.h>
#define debug(x) cerr << #x << " = " << x << endl
#define int long long
using namespace std;
const int N = 40;
int n, m, ans;
int a[N], dpu[N / 2], dpd[N / 2], prep[1 << (N / 2)];
void set_prep() {
for (int i = 0; i < N / 2; i++)
prep[1 << i] = i;
}
void read_input() {
cin >> n >> m;
for (int i = 0; i < n; i++)
cin >> a[i];
}
void solve() {
set_prep();
int nu = n / 2, nd = (n + 1) / 2;
for (int mask = 1; mask < (1 << nu); mask++)
dpu[mask] = dpu[mask ^ (mask & -mask)] + a[prep[mask & -mask]];
for (int mask = 1; mask < (1 << nd); mask++)
dpd[mask] = dpd[mask ^ (mask & -mask)] + a[prep[mask & -mask] + nu];
sort(dpu, dpu + (1 << nu));
sort(dpd, dpd + (1 << nd));
for (int i = 0; i < (1 << nu); i++) {
if (dpu[i] > m)
break;
ans += upper_bound(dpd, dpd + (1 << nd), m - dpu[i]) - dpd;
}
}
void write_output() {
cout << ans << endl;
}
int32_t main() {
ios :: sync_with_stdio(0), cin.tie(0), cout.tie(0);
read_input(), solve(), write_output();
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... |
# | 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... |