제출 #66042

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
66042		bazsi700	Ice Hockey World Championship (CEOI15_bobek)	C++14	40 / 100	1087 ms	62184 KiB

bobek

#include <bits/stdc++.h>

using namespace std;
#define ll long long

//14:20
int n;
ll m;
ll c[45];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> m;
    for(int i = 0; i < n; i++) {
        cin >> c[i];
    }
    if(n <= 21) {
        ll ways = 0;
        for(int mask = 0; mask < (1<<n); mask++) {
            ll money = m;
            for(int i = 0; i < n; i++) {
                if(mask&(1<<i)) {
                    money-= c[i];
                }
            }
            if(money >= 0) {
                ways++;
            }
        }
        cout << ways;
    } else {
        ll ways = 0;
        set<ll> did;
        map<ll,int> did1;
        map<ll,int> did2;
        for(int mask = 0; mask < (1<<20); mask++) {
            ll money = m;
            for(int i = 0; i < 20; i++) {
                if(mask&(1<<i)) {
                    money-= c[i];
                }
            }
            if(money >= 0) {
                did1[m-money]++;
                did.insert(m-money);
            }
        }
        ll prev = -1;
        for(int el : did) {
            if(prev != -1) {
                did2[el] = prev = did1[el]+prev;
            } else {
                did2[el] = prev = did1[el];
            }
        }
        for(int mask = 0; mask < (1<<(n-20)); mask++) {
            ll money = m;
            for(int i = 20; i < n; i++) {
                if(mask&(1<<(i-20))) {
                    money-= c[i];
                }
            }
            if(money >= 0) {
                auto it = did.upper_bound(money);
                if(it != did.begin()) {
                    it--;
                    ways+= did2[*it];
                }
            }
        }
        cout << ways;
    }
    return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 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