Submission #344700

#	Time	Username	Problem	Language	Result	Execution time	Memory
344700		_zheksenov	Bank (IZhO14_bank)	C++14	71 / 100	1071 ms	512 KiB

bank

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N = 21;
const int M = 1e3 + 7;

int n, m;
int a[N], b[N];
int cnt[M];
 
bool rock(int x) {
    if (n==1 && a[x] == 0) 
        return 1;
    if (x == n)
        return 1;
    if (!a[x])
        return rock(x + 1);
    for (int i = a[x]; i > 0; i--) {
        if (cnt[i]) {
            cnt[i]--;
            a[x] -= i;
            if (rock(x) == 1)
                return 1;
            a[x] += i;
            cnt[i]++;
        }
    }
    return 0;
}               

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    cin >> n >> m;
    for (int i = 0; i < n; i++) 
        cin >> a[i];
    for (int i = 0; i < m; i++) {
        cin >> b[i];
        cnt[b[i]]++;
    }
    if (n == 1) {
        int x = a[0];
        for (int ma = 1; ma <= (1 << m); ma++) {
            int sm = 0;
            for (int i = 0; i < m; i++) {
                if ((1 << i) & ma) {
                    sm += b[i];
                }
            }
            if (sm == x) {
                cout << "YES";
                exit(false);
            }
        }
        cout << "NO";
        exit(false);
    }
    cout << (rock(0) == 1 ? "YES" : "NO");
    return 0;
}       

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