제출 #1192281

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1192281		orgiloogii	Bank (IZhO14_bank)	C++20	100 / 100	79 ms	8648 KiB

bank

#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <queue>
using namespace std;

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n, m;
    cin >> n >> m;
    vector<int> 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<pair<int, int>> dp(1 << m, {-1, -1});
    dp[0] = {0, 0};
    for (int s = 0;s < (1 << m);s++) {
        int id = dp[s].first;
        int ext = dp[s].second;
        if (id == -1) continue;
        for (int i = 0;i < m;i++) {
            if (s & (1 << i)) continue;
            if (ext + b[i] == a[id]) {
                dp[s | (1 << i)] = {id + 1, 0};
            }
            else if (ext + b[i] < a[id]) {
                dp[s | (1 << i)] = {id, ext + b[i]};
            }
        }
    }
    for (int s = 0;s < (1 << m);s++) {
        if (!(dp[s].first ^ n)) {
            cout << "YES" << endl;
            return 0;
        }
    }
    cout << "NO" << endl;
    return 0;
}

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