Submission #1140991

#	Time	Username	Problem	Language	Result	Execution time	Memory
1140991		Aliyyiakbar	Bank (IZhO14_bank)	C++20	100 / 100	253 ms	4652 KiB

bank

/*
#ifndef ONLINE_JUDGE
#include "AkbarKING.h"
#else
#define debug(...)
#define debugArr(...)
#define debugG(...)
#endif
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define int long long
#define $AzH_TxdmN$ ios_base::sync_with_stdio(0);cin.tie(nullptr);cout.tie(nullptr);
#pragma GCC target("sse,sse2,sse3,ssse3,popcnt,abm,mmx,tune=native")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("fast-math")

#define ep emplace_back
#define pb push_back
#define pii pair<int,int>
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()

using namespace std;
using namespace __gnu_pbds;

template <typename T>
using __indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <typename T>
using __indexed_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;

mt19937 rng(chrono::steady_clock().now().time_since_epoch().count());

const int sz = 3e5+9;
const int LOG = 21;
const int MOD = 1e9+7;
const int INF = 1e18;
int a[sz], b[sz];

int n, m;
vector<int>BIT[LOG];

bitset<(1LL << LOG)> memo[LOG];
bitset<(1LL << LOG)> vis[LOG];

bool backtrack(int i, int currMask)
{
    if (i == n)
    {
        vis[i][currMask] = 1;
        return memo[i][currMask] = 1;
    }
    if (vis[i][currMask])
    {
        return memo[i][currMask];
    }
    vis[i][currMask] = 1;
    for (int subMask : BIT[i])
    {
        if (currMask & subMask)
        {
            continue;
        }
        if (backtrack(i + 1, currMask | subMask))
        {
            vis[i][currMask] = 1;
            return memo[i][currMask] = 1;
        }
    }
    return memo[i][currMask] = 0;
}

void solve()
{
    cin >> n >> m;
    for (int i = 0; i < n; ++i)
    {
        cin >> a[i];
    }
    for (int i = 0; i < m; ++i)
    {
        cin >> b[i];
    }
    for (int i = 0; i < n; ++i)
    {
        for (int mask = 1; mask < (1LL << m); ++mask)
        {
            int sum = 0, fl = 1;
            for (int j = 0; j < m; ++j)
            {
                if (mask & (1LL << j))
                {
                    sum += b[j];
                }
                if (sum > a[i])
                {
                    fl = 0;
                    break;
                }
            }
            if (fl && sum == a[i])
            {
                BIT[i].ep(mask);
            }
        }
    }
    cout << (backtrack(0, 0) ? "YES" : "NO") << '\n';
}

signed main()
{
    $AzH_TxdmN$
    int t = 1;
    // cin >> t;
    while (t--)
    {
        solve();
    }
}

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