Submission #1273721

#	Time	Username	Problem	Language	Result	Execution time	Memory
1273721		quanduongxuan12	Bank (IZhO14_bank)	C++20	100 / 100	347 ms	54480 KiB

bank

#include <bits/stdc++.h>
using namespace std;
#define name "bank"
#define MAXN 22
#define pb push_back
#define pf push_front
#define ll long long
#define ii pair<int, int>
#define fs first
#define sc second
#define ill pair<int, ll>
#define lli pair<ll, int>
#define llll pair<ll, ll>
#define all(v) v.begin(),v.end()
#define uni(v) v.erase(unique(all(v)),v.end())
#define bit(n,i) (((n)>>(i))&1)
#define FOR(i,a,b) for (int i=(a),_b=(b); i<=_b; i++)
#define FORD(i,a,b) for (int i=(a),_b=(b); i>=_b; i--)
#define MASK(i) (1LL<<(i))
const int INF=1e9;
const int MOD=1e9+7;
void add(int &u, int v){
    u+=v;
    if (u>=MOD) u-=MOD;
}
void sub(int &u, int v){
    u-=v;
    if (u<0) u+=MOD;
}
void minimize(int &u, int v){
    u=min(u,v);
}
void maximize(int &u, int v){
    u=max(u,v);
}
long long Rand(long long l, long long r){
    ll tmp=0;
    FOR(i,1,4) tmp=((tmp<<15)^(((1<<15)-1)&rand()));
    return l+tmp%(r-l+1);
}
int n,m;
int a[MAXN],b[MAXN];
int dp[MAXN][MASK(20)];
vector<int> vec[MAXN];
int main()
{
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    cin>>n>>m;
    FOR(i,1,n) cin>>a[i];
    FOR(i,1,m) cin>>b[i];
    FOR(i,1,n){
        FOR(mask,1,MASK(m)-1){
            int cur=0;
            for (int haha=mask; haha>0; haha^=haha&-haha){
                int j=__builtin_ctz(haha)+1;
                cur+=b[j];
            }
            if (cur==a[i]){
                vec[i].pb(mask);
            }
        }
    }
    dp[0][0]=1;
    FOR(i,0,n-1){
        FOR(mask,0,MASK(m)-1){
            if (!dp[i][mask]) continue;
            int u=MASK(m)-1-mask;
            for (int x:vec[i+1]){
                if ((x&u)==x) dp[i+1][mask|x]=1;
            }
        }
    }
    FOR(mask,0,MASK(m)-1){
        if (dp[n][mask]){
            cout<<"YES";
            return 0;
        }
    }
    cout<<"NO";
    return 0;
}

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