Submission #438798

#	Time	Username	Problem	Language	Result	Execution time	Memory
438798		jalsol	Bank (IZhO14_bank)	C++17	100 / 100	154 ms	4352 KiB

bank

#ifdef LOCAL
#include <local.h>
#else
#include <bits/stdc++.h>
#define debug(...)
#endif

const int maxn = 20;

int n, m;
int a[maxn];
int b[maxn];
int dp[1 << maxn];

int go(int i, int mask, int sum) {
    if (i >= n) return true;

    int &ret = dp[mask];
    if (ret != -1) return ret;

    for (int j = 0; j < m; j++) {
        if (mask >> j & 1) continue;

        if (sum + b[j] == a[i]) {
            if (go(i + 1, mask | (1 << j), 0)) {
                return ret = true;
            }
        }
        else if (sum + b[j] < a[i]) {
            if (go(i, mask | (1 << j), sum + b[j])) {
                return ret = true;
            }
        }
    }

    return ret = false;
}

signed main() {
    std::ios_base::sync_with_stdio(false); std::cin.tie(nullptr);

    std::cin >> n >> m;

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

    std::fill_n(dp, 1 << maxn, -1);
    std::cout << (go(0, 0, 0) ? "YES" : "NO") << '\n';

    return 0;
}

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