Submission #1336966

#	Time	Username	Problem	Language	Result	Execution time	Memory
1336966		Born_To_Laugh	Ice Hockey World Championship (CEOI15_bobek)	C++17	50 / 100	204 ms	20972 KiB

bobek

// Born_To_Laugh - Hughie Do
#include <bits/stdc++.h>
#define alle(AC) AC.begin(), AC.end()
#define fi first
#define se second
using namespace std;
typedef long long ll;
[[maybe_unused]] const ll MOD = 998244353, INF = 1e9 + 7;
const int maxn = 50;
int n, m;
ll k;
int a[maxn];
vector<ll> num1, num2;
void brute1(int id, ll sum){
    if(id == m){
        num1.push_back(sum);
        return;
    }
    brute1(id + 1, sum);
    brute1(id + 1, sum + a[id + 1]);
}
void brute2(int id, ll sum){
    if(id == n){
        num2.push_back(sum);
        return;
    }
    brute2(id + 1, sum);
    brute2(id + 1, sum + a[id + 1]);
}

void solve(){
    cin >> n >> k;
    for(int i=1; i<=n; ++i)cin >> a[i];
    m = n >> 1;
    brute1(0, 0);
    brute2(m, 0);
    sort(alle(num1));
    sort(alle(num2));
    ll ans = 0;
    for(auto &elm: num1){
        int sth = upper_bound(alle(num2), k - elm) - num2.begin();
        ans += sth;
    }
    cout << ans << '\n';
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
}

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