제출 #1169118

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1169118		GoBananas69	Bank (IZhO14_bank)	C++20	25 / 100	2 ms	840 KiB

bank

#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <bitset>
typedef long long ll;
using namespace std;
int n, m;
vector<int> a, b;
vector<vector<int>> mask;

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

signed main() {
    cin.tie() -> sync_with_stdio(0);
    cin >> n >> m;
    if (n > m) {
        cout << "NO\n";
        return 0;
    }
    a.resize(n);
    b.resize(m);
    int sum = 0;
    for (int &i: a) cin >> i;
    for (int &i: b) {
        cin >> i;
        sum += i;
    }
    mask.resize(sum + 1);
    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);
    cout << "NO\n";
    return 0;
}

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