Submission #1169057

#	Time	Username	Problem	Language	Result	Execution time	Memory
1169057		GoBananas69	Bank (IZhO14_bank)	C++20	71 / 100	1095 ms	8008 KiB

bank

#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <bitset>
typedef long long ll;
using namespace std;
bool ok = false;
int n, m;

void one(vector<int> &a, vector<int> &b) {
    ll x = a[0];
    ll t = 1 << m;
    for (ll i = 0; i<t; ++i) {
        ll curr = 0;
        for (ll j = 0; j<m; ++j) {
            if (i & (1 << j)) curr += b[j];
        }
        if (curr == x) {
            cout << "YES\n";
            exit(0);
        }
    }
    cout << "NO\n";
    exit(0);
}

void solve(int curr, int k, vector<int> &a, vector<vector<int>> &mask) {
    if (k == n) {
        cout << "YES\n";
        exit(0);
    }
    for (auto &i: mask[a[k]]) {
        if (!(curr & i)) {
            solve(curr | i, k + 1, a, mask);
        }
    }
}

signed main() {
    cin.tie() -> sync_with_stdio(0);
    cin >> n >> m;
    vector<int> a(n), b(m);
    if (n > m) {
        cout << "NO\n";
        return 0;
    }
    int sum = 0;
    for (int i = 0; i<n; ++i) cin >> a[i];
    for (int i = 0; i<m; ++i) {
        cin >> b[i];
        sum += b[i];
    }

    if (n == 1) {
        one(a, b);
    }

    vector<vector<int>> mask(sum + 1); 
    vector<bool> dp(1 << n, true);
    
    for (int i = 0; i<(1 << m); ++i) {
        int curr = 0;
        for (int j = 0; j<m; ++j) {
            if (i & (1 << j)) curr += b[j];
        }
        mask[curr].push_back(i);
    }
    
    for (int i = 0; i<n; ++i) {
        if (mask[a[i]].empty()) {
            cout << "NO\n";
            return 0;
        }
    }

    solve(0, 0, a, mask);

    cout << "NO\n";
}

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