이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for(ll i = a; i < b; i++)
ll n, m, o, t, sum, ans, a[50], s[1050000];
bitset<50> c;
int main(){
cin >> n >> m; o = n/2; t = n-o;
FOR(i, 0, n) cin >> a[i];
FOR(i, 0, (1 << o)){
c = bitset<50>(i);
FOR(j, 0, o){
if(c.test(j)) s[i] += a[j];
}
}
sort(s, s+(1 << o));
FOR(i, 0, (1 << t)){
c = bitset<50>(i); sum = 0;
FOR(j, 0, t){
if(c.test(j)) sum += a[o+j];
}
ans += upper_bound(s, s+(1<<o), m-sum)-s;
}
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... |