Submission #1132899

#	Time	Username	Problem	Language	Result	Execution time	Memory
1132899		DangKhoizzzz	Bank (IZhO14_bank)	C++20	0 / 100	1095 ms	460 KiB

bank

//-----------------(boost)-----------------//
#pragma GCC target ("avx2")                //
#pragma GCC optimization ("O3")            //
#pragma GCC optimization ("unroll-loops")  //
//---------------------------------------- //
#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define pii pair <int , int>
#define ar3 array <int , 3>


using namespace std;

const int INF = 1e9 + 7;
const int maxn = 2e5 + 7;

int n , m , a[40] , b[40];
bool dp[40][10000];

bool check(int a , int b)
{
    for(int i = 0; i <= 20; i++)
    {
        if(!((a >> i)&1) && ((b >> i)&1)) return 0;
    }
    return 1;
}

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

    dp[0][0] = 1;

    for(int i = 1; i <= n; i++)
    {
        for(int mask1 = 1; mask1 < (1 << m); mask1++)
        {
            for(int mask2 = 1; mask2 < (1 << m); mask2++)
            {
                if(!check(mask1 , mask2)) continue;

                int sum = 0;

                for(int j = 0; j < m; j++)
                {
                    if((mask2 >> j)&1) sum += b[j+1];
                }

                if(sum == a[i] && a[i] == sum)
                {
                    dp[i][mask1] = max(dp[i-1][(mask1^mask2)] , dp[i-1][mask1]);
                }
            }
        }
    }
    bool ans = 0;

    for(int mask = 0; mask < (1 << m); mask++)
    {
        ans = max(ans , dp[n][mask]);
    }

    if(ans) cout << "YES" << '\n';
    else cout << "NO" << '\n';
}


int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    solve();
    return 0;
}

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