이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int maxn = 45;
vector<int> v;
int n, m;
int a[maxn];
int mid;
int ans = 0;
void rec(int i, int sum)
{
if (i == mid)
{
v.push_back(sum);
return;
}
rec(i + 1, sum); rec(i + 1, sum + a[i]);
}
void rec2(int i, int sum)
{
if (i == mid - 1)
{
int idx = upper_bound(v.begin(), v.end(), m - sum) - v.begin();
// cout<<sum<<" "<<idx<<endl;
ans += idx;
return;
}
rec2(i - 1, sum); rec2(i - 1, sum + a[i]);
}
signed main()
{
cin>>n>>m;
for(int i=0; i<n; i++) cin>>a[i];
mid = (n + 1) / 2;
rec(0, 0);
sort(v.begin(), v.end());
// for(auto i : v) cout<<i<<" ";
// cout<<endl;
rec2(n - 1, 0);
cout<<ans<<endl;
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... |