Submission #441932

#	Time	Username	Problem	Language	Result	Execution time	Memory
441932		tht2005	Bank (IZhO14_bank)	C++17	100 / 100	343 ms	205580 KiB

bank

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

#define nmax 25

int n, m, a[nmax], b[nmax], f[nmax][1<<21];

int dp(int i, int mask, int64_t sum)
{
    if(f[i][mask] != -1)
        return f[i][mask];
    if(i >= n)
        return f[i][mask] = 1;
    f[i][mask] = 0;
    for(int t = 0; t < m; ++t) {
        if((mask >> t) & 1) continue;
        if(sum + b[t] < a[i]) {
            if(dp(i, mask | (1 << t), sum + b[t])) f[i][mask] = 1;
        }
        else if(sum + b[t] == a[i]) {
            if(dp(i + 1, mask | (1 << t), 0)) f[i][mask] = 1;
        }
    }
    return f[i][mask];
}

int main()
{
    ios::sync_with_stdio(false); cin.tie(NULL);
    cin >> n >> m;
    for(int i = 0; i < n; ++i)
        cin >> a[i];
    for(int i = 0; i < m; ++i)
        cin >> b[i];
    memset(f, -1, sizeof(f));
    cout << (dp(0, 0, 0) ? "YES" : "NO") << '\n';
    return 0;
}

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