제출 #446845

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
446845		bigDuck	은행 (IZhO14_bank)	C++14	52 / 100	1079 ms	4392 KiB

bank

#include<bits/stdc++.h>
using namespace std;
#define INIT  ios_base :: sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define mp make_pair
#define pb push_back
#define ft first
#define sc second
#define ll long long
#define pii pair<int, int>
#define count_bits __builtin_popcount
//#define int ll

int t, n, m, a[30], b[30];

int dp[1ll<<20 ];
int sum[1ll<<20];



int32_t main(){
INIT

cin>>n>>m;
for(int i=1; i<=n; i++){
    cin>>a[i];
}
for(int i=1; i<=m; i++){
    cin>>b[i];
    sum[1ll<<(i-1)]=b[i];
}

for(int B=1; B<(1ll<<m); B++){
    sum[B]=sum[B&(-B)]+sum[B^( (B&(-B)) )];
}



for(int B=1; B<(1ll<<m); B++){
    for(int s=B; s>0; s=(s-1)&B){
        if( (dp[B^s]==0) && (s<B) ){
            continue;
        }
        if(sum[s]==a[dp[B^s]+1]){
            dp[B]=dp[B^s]+1;
            break;
        }
    }
    if(dp[B]==n){
        cout<<"YES"; return 0;
    }
}
cout<<"NO";


return 0;
}

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