Submission #1121645

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1121645	2024-11-29 07:13:29	vjudge1	Ice Hockey World Championship (CEOI15_bobek)	C++17	100 / 100	437 ms	20908 KiB

bobek

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
#define ll long long
vector<ll> getSubsetSum(const vector<ll>& subset) {
    vector<ll> subsetSums;
    int n = subset.size();
    for (int i = 0; i < (1 << n); ++i) {
        ll sum = 0;
        for (int j = 0; j < n; ++j) {
            if (i & (1 << j)) {
                sum += subset[j];
            }
        }
        subsetSums.push_back(sum);
    }
    return subsetSums;
}
ll countWays(int N, ll M, const vector<ll>& costs) {
    vector<ll> leftHalf(costs.begin(), costs.begin() + N / 2);
    vector<ll> rightHalf(costs.begin() + N / 2, costs.end());
    vector<ll> leftSums = getSubsetSum(leftHalf);
    vector<ll> rightSums = getSubsetSum(rightHalf);
    sort(rightSums.begin(), rightSums.end());
    ll count = 0;
    for (ll leftSum : leftSums) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• 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