제출 #1280372

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1280372		peanut	은행 (IZhO14_bank)	C++20	71 / 100	1095 ms	1340 KiB

bank

#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define fi first
#define se second
#define pb push_back
#define mp make_pair

vector<int> dx = {0, 0, 1, -1};
vector<int> dy = {1, -1, 0, 0};

const int maxn = 20 + 5;
const int MOD = 1e9 + 7;
const int INF = 0x3f3f3f3f;

int salary[maxn], notes[maxn];
bool dp[1 << 20];
int main()
{
    ios::sync_with_stdio(false); cin.tie(0);
    //freopen(".INP", "r", stdin);
    //freopen(".OUT", "w", stdout);
    int n, m; cin >> n >> m;
    for (int i = 0; i < n; ++i) cin >> salary[i];
    for (int i = 0; i < m; ++i) cin >> notes[i];

    vector<vector<int>> valid(n);
    for (int i = 0; i < (1 << m); ++i)
    {
        int sum = 0;
        for (int j = 0; j < m; ++j) if (i >> j & 1) sum += notes[j];
        for (int j = 0; j < n; ++j) if (sum == salary[j]) valid[j].pb(i);
    }

    if (n == 1)
    {
        if (sz(valid[0])) cout << "YES";
        else cout << "NO";
        return 0;
    }
    dp[0] = true;
    for (int i = 0; i < n; ++i)
    {
        for (int j = (1 << m) - 1; j >= 0; --j)
        {
            dp[j] = false;
            for (auto k : valid[i]) if ((k & j) == k) dp[j] |= dp[j ^ k];
        }
    }

    for (int i = 0; i < (1 << m); ++i)
    {
        if (dp[i])
        {
            cout << "YES";
            return 0;
        }
    }
    cout << "NO";
    return 0;
}

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