Submission #902681

#	Time	Username	Problem	Language	Result	Execution time	Memory
902681		Ghetto	Bank (IZhO14_bank)	C++17	100 / 100	167 ms	2648 KiB

bank

#include <bits/stdc++.h>    
using namespace std;
const int MAX_N = 20 + 2, MAX_M = MAX_N;

int n, m;
int a[MAX_N], b[MAX_M];

int pref_sum[MAX_N];
void precomp() {
    for (int i = 1; i <= n; i++)
        pref_sum[i] = pref_sum[i - 1] + a[i];
}

bool dp[1 << MAX_M];

int main() {
    // freopen("bank.in", "r", stdin);

    cin >> n >> m;
    for (int i = 1; i <= n; i++)
        cin >> a[i];
    for (int i = 1; i <= m; i++)
        cin >> b[i];

    precomp();

    for (int mask = (1 << m) - 1; mask >= 0; mask--) {
        int b_sum = 0;
        for (int i = 1; i <= m; i++)
            if (mask & (1 << (i - 1)))
                b_sum += b[i];
        
        if (upper_bound(pref_sum + 1, pref_sum + 1 + n, b_sum) == pref_sum + 1 + n) {
            dp[mask] = true;
            continue;
        }
        int left = *upper_bound(pref_sum + 1, pref_sum + 1 + n, b_sum) - b_sum;

        for (int i = 1; i <= m; i++) {
            if (mask & (1 << (i - 1))) continue;
            if (b[i] > left) continue;

            if (dp[mask ^ (1 << (i - 1))])
                dp[mask] = true;
        }
         
        // cout << mask << ": " << dp[mask] << endl;
    }
    cout << ((dp[0]) ? "YES" : "NO") << endl;
}

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