제출 #138969

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
138969		meatrow	Ice Hockey World Championship (CEOI15_bobek)	C++17	100 / 100	587 ms	8832 KiB

bobek

//#pragma GCC optimize("O3")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,tune=native")
//#pragma GCC optimize ("unroll-loops")
#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using ld = long double;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int n;
    ll m;
    cin >> n >> m;
    vector<ll> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    int left_sz = n / 2, right_sz = n - left_sz;
    int topkek = 1 << right_sz;
    vector<ll> weights;
    for (int mask = 0; mask < topkek; mask++) {
        ll kek = 0;
        for (int i = 0; i < right_sz; i++) {
            if (mask & (1 << i)) {
                kek += a[left_sz + i];
            }
        }
        weights.push_back(kek);
    }
    topkek = 1 << left_sz;
    ll ans = 0;
    sort(weights.begin(), weights.end());
    for (int mask = 0; mask < topkek; mask++) {
        ll kek = 0;
        for (int i = 0; i < left_sz; i++) {
            if (mask & (1 << i)) {
                kek += a[i];
            }
        }
        ans += upper_bound(weights.begin(), weights.end(), m - kek) - weights.begin();
    }
    cout << ans;
    return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 10 / 10
• Subtask 9: 10 / 10
• Subtask 10: 10 / 10