이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
//besmellah
#include <bits/stdc++.h>
using namespace std;
#define int long long
int sum[1 << 20], a[40];
vector <int> V;
int32_t main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++)
cin >> a[i];
V.push_back(0);
for (int mask = 1; mask < (1 << (n / 2)); mask++) {
sum[mask] = sum[mask - (mask & -mask)] + a[__builtin_ctz(mask)];
V.push_back(sum[mask]);
}
sort(V.begin(), V.end());
int ans = 0;
ans += upper_bound(V.begin(), V.end(), m) - V.begin();
for (int mask = 1; mask < (1 << ((n + 1) / 2)); mask++) {
sum[mask] = sum[mask - (mask & -mask)] + a[n / 2 + __builtin_ctz(mask)];
ans += upper_bound(V.begin(), V.end(), m - sum[mask]) - V.begin();
}
cout << ans;
}
# | 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... |