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 <bits/stdc++.h>
#define Loop(x,l,r) for (ll x = (l); x < (ll)(r); ++x)
#define LoopR(x,l,r) for (ll x = (r)-1; x >= (ll)(l); --x)
typedef long long ll;
typedef std::pair<int, int> pii;
typedef std::pair<ll , ll > pll;
using namespace std;
const int N = 40, M = 20;
ll a[N];
ll mim[1<<M];
ll sum2[1<<M];
ll bud;
int n;
int main()
{
cin.tie(0) -> sync_with_stdio(false);
cin >> n >> bud;
Loop (i,0,n)
cin >> a[i];
int m = n/2;
Loop (msk,1,1<<m) {
int i = __builtin_ctz(msk);
mim[msk] = mim[msk ^ (1<<i)] + a[i];
}
ll ans = upper_bound(mim, mim+(1<<m), bud) - mim;
sort(mim, mim + (1<<m));
Loop (msk,1,1<<(n-m)) {
int i = __builtin_ctz(msk);
sum2[msk] = sum2[msk ^ (1<<i)] + a[i + m];
ans += upper_bound(mim, mim+(1<<m), bud-sum2[msk]) - mim;
}
cout << ans << '\n';
}
# | 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... |