Submission #405127

#	Time	Username	Problem	Language	Result	Execution time	Memory
405127		Falcon	Bank (IZhO14_bank)	C++17	100 / 100	171 ms	11156 KiB

bank

#include <bits/stdc++.h>

#ifdef DEBUG
#include "debug.hpp"
#endif

using namespace std;

#define all(c)              (c).begin(), (c).end()
#define rall(c)             (c).rbegin(), (c).rend()
#define traverse(c, it)     for(auto it = (c).begin(); it != (c).end(); ++it)
#define rep(i, N)           for(int i = 0; i < (N); ++i)
#define rrep(i, N)          for(int i = (N) - 1; i >= 0; --i)
#define rep1(i, N)          for(int i = 1; i <= (N); ++i)
#define rep2(i, s, e)       for(int i = (s); i <= (e); ++i)

#ifdef DEBUG
#define debug(x...)         { \
                            ++dbg::depth; \
                            string dbg_vals = dbg::to_string(x); \
                            --dbg::depth; \
                            dbg::fprint(__func__, __LINE__, #x, dbg_vals); \
                            }

#define light_debug(x)      { \
                            dbg::light = true; \
                            dbg::dout << __func__ << ":" << __LINE__; \
                            dbg::dout << "  " << #x << " = " << x << endl; \
                            dbg::light = false; \
                            }

#else
#define debug(x...)         42
#define light_debug(x)      42
#endif


using ll = long long;

template<typename T>
inline T& ckmin(T& a, T b) { return a = a > b ? b : a; }

template<typename T>
inline T& ckmax(T& a, T b) { return a = a < b ? b : a; }

template<class Fun>
class y_combinator_result {
    Fun fun_;
public:
    template<class T>
    explicit y_combinator_result(T &&fun): fun_(std::forward<T>(fun)) {}

    template<class ...Args>
    decltype(auto) operator()(Args &&...args) {
        return fun_(std::ref(*this), std::forward<Args>(args)...);
    }
};

template<class Fun>
decltype(auto) y_combinator(Fun &&fun) {
    return y_combinator_result<std::decay_t<Fun>>(std::forward<Fun>(fun));
}


int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n, m; cin >> n >> m;
    vector<int> a(n), b(m);
    rep(i, n) cin >> a[i];
    rep(i, m) cin >> b[i];
    sort(all(b));

    vector<vector<bool>> dp(n + 1, vector<bool>(1 << m));
    vector<vector<bool>> ch(n + 1, vector<bool>(1 << m));
    rep(i, 1 << m) dp[0][i] = true, ch[0][i] = true;

    vector<vector<int>> sums(1001);
    rep(c, 1 << m) {
        int s{};
        rep(i, m)
            if(c & (1 << i)) s += b[i];
        if(s <= 1000) sums[s].push_back(c);
    }

    y_combinator([&](auto rec, int i, int x) -> bool {
            if(ch[i][x]) return dp[i][x];
            ch[i][x] = true;
            for(int y: sums[a[i - 1]])
                if((y & x) == y && rec(i - 1, x ^ y))
                    return dp[i][x] = true;
            return dp[i][x] = false;
    })(n, (1 << m) - 1);

    cout << (dp[n].back() ? "YES" : "NO") << '\n';
        
    
    
    #ifdef DEBUG
    dbg::dout << "\nExecution time: "
              << clock() * 1000 / CLOCKS_PER_SEC 
              << "ms" << endl;
    #endif
    return 0;
}

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