Submission #1215160

#	Time	Username	Problem	Language	Result	Execution time	Memory
1215160		sakura	Bank (IZhO14_bank)	C++20	100 / 100	448 ms	86604 KiB

bank

// #define ONLINE_JUDGE
#include "bits/stdc++.h"
using namespace std;
#if __has_include("cleanup/debug.h") && (!defined(ONLINE_JUDGE))
    #include "cleanup/debug.h"
#else
    #pragma message("debug.h not found, or ONLINE_JUDGE defined.")
    #define print(...) ((void)0)
    #define printarr(...) ((void)0)
#endif
using ll = long long;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define kill(x) return void(cout << (x));
#define each(x, v) for (auto &x : (v))
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void getv(T& v) {each(i, v)cin>>i;}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class T> T rnglr(T l, T r) {return uniform_int_distribution<T>(l, r)(rng);}
void solve();
int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);
    // freopen("area.in", "r", stdin);
    int tt = 1;
    // cin >> tt;
    while(tt--) {
        solve();
        if(tt) cout << '\n';
    }return 0;
}

void solve() {
    int n, m, t; cin >> n >> m;
    int po[n], ba[m];
    for (int i = 0; i < n; i++)
        cin >> po[i];
    for (int i = 0; i < m; i++)
        cin >> ba[i];

    vector<vector<int>> subsetsums(n);
    int limit = 1 << m;
    for (int msk = 1; msk < limit; msk++) {
        int csum = 0;
        for (int i = 0; i < m; i++)
            csum += (msk >> i & 1) * ba[i];
        for (int i = 0; i < n; i++) 
            if (csum == po[i])
                subsetsums[i].push_back(msk);
    }
    vector<vector<int>> dp(n, vector<int>(1 << m, -1));
    function<bool(int, int)> dfs = [&](int idx, int msk) -> bool {
        if (idx == n)
            return 1;
        if (~dp[idx][msk])
            return dp[idx][msk];
        dp[idx][msk] = 0;
        for (int i = 0; i < subsetsums[idx].size(); i++) 
            if (!(subsetsums[idx][i] & msk))
                dp[idx][msk] |= dfs(idx+1, msk | subsetsums[idx][i]);
        return dp[idx][msk];
    };
    cout << (dfs(0, 0) ? "YES" : "NO");
}

Compilation message (stderr)

bank.cpp:7:66: note: '#pragma message: debug.h not found, or ONLINE_JUDGE defined.'
    7 |     #pragma message("debug.h not found, or ONLINE_JUDGE defined.")
      |                                                                  ^

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