Submission #735404

#	Time	Username	Problem	Language	Result	Execution time	Memory
735404		Nelt	Bank (IZhO14_bank)	C++17	52 / 100	1082 ms	185184 KiB

bank

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,fma")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

/* DEFINES */
#define S second
#define F first
#define ll long long
#define ull unsigned long long
#define ld long double
#define npos ULLONG_MAX
#define INF LLONG_MAX
#define vv(a) vector<a>
#define pp(a, b) pair<a, b>
#define pq(a) priority_queue<a>
#define qq(a) queue<a>
#define ss(a) set<a>
#define mm(a, b) map<a, b>
#define ump(a, b) unordered_map<a, b>
#define sync                      \
    ios_base::sync_with_stdio(0); \
    cin.tie(0);                   \
    cout.tie(0);
#define elif else if
#define endl "\n"
#define allc(a) begin(a), end(a)
#define all(a) a, a + sizeof(a) / sizeof(a[0])
#define pb push_back
#define logi(a) __lg(a)
#define sqrt(a) sqrtl(a)
#define mpr make_pair
#define ins insert
using namespace std;
using namespace __gnu_pbds;
using namespace __cxx11;
typedef char chr;
typedef basic_string<chr> str;
template <typename T, typename key = less<T>>
using ordered_set = tree<T, null_type, key, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const ll N = 20, MAX = 1005;
ll a[N], b[N];
ll dp[1 << N][N + 1];
vv(ll) sum[MAX * N];
void solve()
{
    ll n, m;
    cin >> n >> m;
    for (ll i = 0; i < n; i++)
        cin >> a[i];
    for (ll i = 0; i < m; i++)
        cin >> b[i];
    ll s;
    for (ll msk = 0; msk < (1 << m); msk++)
    {
        s = 0;
        for (ll i = 0; i < m; i++)
            if (msk >> i & 1)
                s += b[i];
        sum[s].pb(msk);
    }
    dp[0][n] = 1;
    for (ll msk = 1; msk < (1 << m); msk++)
    {
        dp[msk][n] = true;
        for (ll i = 0; i < n; i++)
            for (ll sub : sum[a[i]])
                if ((sub & msk) == sub)
                    dp[msk][i] |= dp[msk ^ sub][i + 1];
    }
    cout << (dp[(1 << m) - 1][0] ? "YES\n" : "NO\n");
}
/*

*/
int main()
{
    sync
        // precomp();
        ll t = 1;
    // cin >> t;
    for (ll i = 1; i <= t; i++)
        // cout << "Case #" << i << ": ",
        solve();
    cerr << "\nTime elapsed : " << clock() * 1000.0 / CLOCKS_PER_SEC << " ms\n";
}

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