제출 #1171844

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1171844		nt_nhan	은행 (IZhO14_bank)	C++20	19 / 100	731 ms	327680 KiB

bank

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define el '\n'
int n, m, a[21], b[21];
vector <int> pre[21];
bool dp[21][1 << 21];
int sum[1 << 21];
int32_t main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
    cin >> n >> m;
    for (int i = 1; i <= n; ++i) {
        cin >> a[i];
    }
    for (int j = 1; j <= m; ++j) {
        cin >> b[j];
    }
    for (int mask = 0; mask < (1 << m); ++mask) {
        for (int j = 0; j < m; ++j) {
            if ((mask >> j) & 1) continue;
            sum[mask | (1 << j)] = sum[mask] + b[j + 1];
        }
        dp[0][mask] = true;
    }
    pre[0].push_back(0);
    for (int i = 1; i <= n; ++i) {
        for (int mask = 0; mask < (1 << m); ++mask) {
            if (a[i] == sum[mask]) {
                dp[i][mask] = dp[i - 1][~mask & (1 << m) - 1];
            }
            if (dp[i][mask]) {
                for (int p : pre[i - 1]) {
                    int addmask = p | mask;
                    for (int j = 0; j < m; ++j) {
                        if ((addmask >> j) & 1) continue;
                        int newmask = addmask | (1 << j);
                        dp[i][newmask] = dp[i][newmask] || 1;
                    }
                    pre[i].push_back(addmask);
                }
            }
        }
    }
    cout << (dp[n][(1 << m) - 1] ? "YES" : "NO");

    return 0;
}

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