Submission #550226

#	Time	Username	Problem	Language	Result	Execution time	Memory
550226		Jomnoi	Bank (IZhO14_bank)	C++17	100 / 100	114 ms	8528 KiB

bank

#include <bits/stdc++.h>
#define DEBUG false
using namespace std;

const int MAX_N = 20;

int a[MAX_N], b[MAX_N];
pair <int, int> dp[1<<MAX_N], tmp;

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int N, M;
    cin >> N >> M;
    for(int i = 0; i < N; i++) {
        cin >> a[i]; 
    }
    for(int i = 0; i < M; i++) {
        cin >> b[i];
    }

    for(int i = 0; i < (1<<M); i++) {
        dp[i] = make_pair(-1, -1);
    }

    dp[0] = make_pair(0, 0);
    for(int mask = 0; mask < (1<<M); mask++) {
        for(int i = 0; i < M; i++) {
            int prev = mask ^ (1<<i);
            if(!(mask & (1<<i)) or dp[prev].first == -1) {
                continue;
            }

            tmp = dp[prev];
            if(tmp.second + b[i] > a[dp[prev].first]) {
                continue;
            }

            tmp.second += b[i];
            if(tmp.second == a[dp[prev].first]) {
                tmp.first++;
                tmp.second = 0;
            }
            dp[mask] = tmp;

            if(tmp.first == N) {
                cout << "YES";
                return 0;
            }
        }

    }
    cout << "NO";
    return 0;
}

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