Submission #734116

#	Time	Username	Problem	Language	Result	Execution time	Memory
734116		benjaminkleyn	Bank (IZhO14_bank)	C++17	71 / 100	1078 ms	16344 KiB

bank

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int n, m, a[20], b[20];
vector<int> masks[20001];

set<int> masks1, masks2;
void search1(int i, int cur_mask)
{
    if (i == n / 2)
    {
        masks1.insert(cur_mask);
        return;
    }
    for (const int &mask : masks[a[i]])
        if ((cur_mask & mask) == 0)
            search1(i + 1, cur_mask | mask);
}
void search2(int i, int cur_mask)
{
    if (i == n)
    {
        masks2.insert(cur_mask);
        return;
    }
    for (const int &mask : masks[a[i]])
        if ((cur_mask & mask) == 0)
            search2(i + 1, cur_mask | mask);
}

int dp[2][1 << 20] = {0};

int main()
{
    cin.tie(0)->sync_with_stdio(0);

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

    for (int mask = 0; mask < (1 << m); mask++)
    {
        int sum = 0;
        for (int i = 0; i < m; i++)
            if (mask & (1 << i))
                sum += b[i];
        masks[sum].push_back(mask);
    }
    search1(0, 0);
    search2(n / 2, 0);

    for (int mask : masks1)
        dp[0][mask]++;
    for (int mask : masks2)
        dp[1][mask]++;

    for (int i = 0; i < m; i++)
        for (int j = 0; j < (1 << m); j++)
            if (!(j & (1 << i)))
            {
                dp[0][j] += dp[0][j | (1 << i)];
                dp[1][j] += dp[1][j | (1 << i)];
            }

    int ans = 0;
    for (int i = 0; i < (1 << m); i++)
        if (__builtin_popcount(i) % 2)
            ans -= dp[0][i] * dp[1][i];
        else
            ans += dp[0][i] * dp[1][i];

    cout << (ans == 0 ? "NO\n" : "YES\n");

    return 0;
}

• Subtask 1: 19 / 19
• Subtask 2: 25 / 25
• Subtask 3: 27 / 27
• Subtask 4: 0 / 29