제출 #1295630

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1295630		al95ireyiz	Ice Hockey World Championship (CEOI15_bobek)	C++20	70 / 100	1100 ms	124320 KiB

bobek

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vll vector<ll>
#define len(x) (ll)x.size()
const ll INF = 1e9, INFL = 1e18;
const ll MOD = 1e9 + 7;
const ll maxn = 2e5 + 5;

ll n, m, k = 0;

void _() {
    // kasibligin uzu qara olsun ay Mahir
    cin >> n >> m;
    vll v, v2;
    for(ll i = 1, x; i <= n; i ++){
        cin >> x;
        if(i <= n / 2) v.push_back(x);
        else v2.push_back(x);
    }

    map<ll, ll>mp, mp2;
    ll le = len(v), le2 = len(v2);
    for(ll i = 0; i < (1ll << le); i ++){
        ll cm = 0;
        for(ll j = 0; j < len(v); j ++){
            if(i & (1ll << j)) cm += v[j];
        }
        if(cm > m) continue;
        mp[cm] ++;
    }
    for(ll i = 0; i < (1ll << le2); i ++){
        ll cm = 0;
        for(ll j = 0; j < len(v2); j ++){
            if(i & (1ll << j)) cm += v2[j];
        }
        if(cm > m) continue;
        mp2[cm] ++;
    }
    ll cv = 0;
    vector<pair<ll, ll>>c;
    for(auto [x2, y2] : mp2){
        if(!c.empty()) y2 += c.back().second;
        c.push_back({x2, y2});
    }
    for(auto [x, y] : mp){
        ll l = 0, r = len(c) - 1, nw = 0;
        while(l <= r){
            ll md = (l + r) >> 1;
            if(c[md].first + x <= m){
                l = md + 1;
                nw = c[md].second * y;
            }
            else{
                r = md - 1;
            }
        }
        cv += nw;
    }
    cout << cv << '\n';
}
signed main() {
    cin.tie(0)->sync_with_stdio(0);
    ll t = 1;
    // cin >> t;
    while(t --) _();
}

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