제출 #1357896

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1357896		bimmer	Ice Hockey World Championship (CEOI15_bobek)	C++20	100 / 100	457 ms	4664 KiB

bobek

#include <bits/stdc++.h>
#ifdef LOCAL
#include "algo/debug.h"
#endif
using namespace std;
#define int long long
#define endl '\n'
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()

const int sz = 1e6 + 5, inf = 1e18, mod = 1e9 + 7;

int a[45];

void _(){
    int n, k;
    cin >> n >> k;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    } 
    int mid = (n + 1) / 2 - 1;
    vector<int> v;
    for (int mask = 0; mask < (1 << mid); mask++) {
        int sum = 0;
        for (int i = 1; i <= mid; i++) {
            if (mask & (1 << (i - 1))) {
                sum += a[i];
            }
        }
        if (k < sum) continue;
        v.push_back(sum);
    }
    sort(all(v));
    mid++;
    int ans = 0;
    for (int mask = 0; mask < (1LL << (n - mid + 1)); mask++) {
        int sum = 0;
        for (int i = mid; i <= n; i++) {
            if (mask & (1LL << (i - mid))) {
                sum += a[i];
            }
        }
        if (k < sum) continue;
        int rem = k - sum;
        int j = upper_bound(all(v), rem) - v.begin();
        ans += j;
    }
    cout << ans << endl;
}

signed main(){
    cin.tie(nullptr)->sync_with_stdio(0);
    int T = 1;
    // cin >> T;
    while (T--) _();
}
// By Riyad

• 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