제출 #1245801

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1245801		t6stks	Bank (IZhO14_bank)	C++20	52 / 100	1093 ms	9800 KiB

bank

#include <bits/stdc++.h>
#define F first
#define S second
#define SZ(x) ((int)(x).size())
#define ALL(x) x.begin(), x.end()

using namespace std;
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vii = vector<pii>;
using vll = vector<pll>;

void sol() {
    int n, m;
    cin >> n >> m;
    vi a(n), b(m);
    for (int i = 0; i < n; i++) cin >> a[i];
    for (int i = 0; i < m; i++) cin >> b[i];
    vector<vector<int>> vec(1001);
    for (int i = 0; i < (1 << m); i++) {
        int sum = 0;
        for (int j = 0; j < m; j++) {
            if (i >> j & 1) sum += b[j];
        }
        if (sum <= 1000)
            vec[sum].push_back(i);
    }
    vector<vector<unsigned char>> dp(n + 1, vector<unsigned char>(1 << m, 0));
    dp[0][0] = 1;
    for (int i = 0; i < n; i++) {
        for (int ms = (1 << m) - 1; ms >= 0; ms--) {
            for (int last: vec[a[i]]) {
                if (((last ^ ms) | ms) == ms) {
                    dp[i + 1][ms] |= dp[i][ms ^ last];
                }
            }
        }
    }
    for (int i = 0; i < (1 << m); i++) {
        if (dp[n][i]) return cout << "YES\n", void();
    }
    cout << "NO\n";
}

signed main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    sol();
}

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