제출 #977069

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
977069		SeenSiravit	Ice Hockey World Championship (CEOI15_bobek)	C++14	0 / 100	227 ms	22092 KiB

bobek

#include<bits/stdc++.h>
#define ll long long

using namespace std;

const int mxN = 40 + 5;

int n;
ll m;
ll a[mxN];

vector<ll> comb_l , comb_r;

void make_combination(){

    int mid = n/2;

    // comb_l [1 , mid]
    int lim = 1<<mid;

    for(int mask=0;mask<lim;mask++){
        ll sum = 0;
        for(int i=0;i<mid;i++){
            if((1<<i) & mask) sum += a[i];
            if(sum > m) break;
        }

        if(sum <= m) comb_l.push_back(sum);
    }

    sort(comb_l.begin() , comb_l.end());

    // comb_r
    lim = 1<<(n-mid);

    for(int mask=0;mask<lim;mask++){
        ll sum = 0;
        for(int i=mid;i<n;i++){
            if((1<<i) & mask) sum += a[i];
            if(sum>m) break;
        }

        if(sum <= m) comb_r.push_back(sum);
    }

    sort(comb_r.begin() , comb_r.end());
}

int main(){
    ios::sync_with_stdio(0),cin.tie(0);

    cin>> n >> m;

    for(int i=0;i<n;i++) cin>> a[i];

    make_combination();

    ll ans = 0;

    for(ll val : comb_r){
        int cnt = upper_bound(comb_l.begin() , comb_l.end() , m - val) - comb_l.begin() - 1;
        ans += cnt;
    }

    cout<< ans;

    return 0;
}

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