이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define ll long long
#define pb push_back
int main() {
int n; ll m; cin >> n >> m;
vector<ll> v(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
int mid = (n-1) / 2;
vector<ll> p1;
for (int i = 0; i < (1 << (mid+1)); ++i) {
ll sum = 0;
int x = i;
for (int j = 0; j <= mid; ++j) {
if (x % 2 == 1) sum += v[j];
x /= 2;
}
if (sum <= m) p1.pb(sum);
}
sort(p1.begin(), p1.end());
ll ans = 0;
for (int i = 0; i < (1 << (n - mid - 1)); ++i) {
ll sum = 0;
int x = i;
for (int j = mid + 1; j < n; ++j) {
if (x % 2 == 1) sum += v[j];
x /= 2;
}
if (sum > m) continue;
int k = upper_bound(p1.begin(), p1.end(), m - sum) - p1.begin();
ans += 1ll * k;
}
cout << ans << "\n";
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... |