Submission #1220359

#TimeUsernameProblemLanguageResultExecution timeMemory
1220359toast12Ice Hockey World Championship (CEOI15_bobek)C++20
10 / 100
167 ms20704 KiB
#include <bits/stdc++.h>
using namespace std;

using ll = long long;

int main() {
    int n;
    ll m;
    cin >> n >> m;
    vector<ll> v(n);
    for (int i = 0; i < n; i++) cin >> v[i];
    vector<ll> l, r;
    for (int mask = 0; mask < (1<<(n/2)); mask++) {
        ll sum = 0;
        for (int i = 0; i < (n/2); i++) {
            if (mask & (1<<i)) sum += v[i];
        }
        if (sum <= m) l.push_back(sum);
    }
    for (int mask = 0; mask < (1<<(n-(n/2))); mask++) {
        ll sum = 0;
        for (int i = 0; i < n-(n/2); i++) {
            if (mask & (1<<i)) sum += v[i+(n/2)];
        }
        if (sum <= m) r.push_back(sum);
    }
    ll ans = 0;
    for (int i = 0; i < l.size(); i++) {
        auto it = upper_bound(r.begin(), r.end(), m-l[i]);
        ans += int(it-r.begin());
    }
    cout << ans << '\n';
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...