Submission #791920

#TimeUsernameProblemLanguageResultExecution timeMemory
79192012345678Bank (IZhO14_bank)C++17
25 / 100
1084 ms5332 KiB
#include <bits/stdc++.h>

using namespace std;

const int nx=25;
int n, m, a[nx], b[nx], sm[1<<20];
bool dp[nx][1<<20];

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>m;
    for (int i=1; i<=n; i++) cin>>a[i];
    for (int i=0; i<m; i++) cin>>b[i];
    for (int i=0; i<m; i++) sm[(1<<i)]=b[i];
    for (int i=1; i<(1<<m); i++) sm[i]=sm[i-(i&-i)]+sm[i&-i];
    for (int i=0; i<(1<<m); i++) dp[0][i]=1;
    for (int i=1; i<=n; i++) for (int j=1; j<(1<<m); j++) for (int k=0; k<(1<<m); k++) if ((!(j&k))&&sm[j]==a[i]&&dp[i-1][k]) dp[i][j|k]=1;
    cout<<(dp[n][(1<<m)-1]?"YES":"NO");
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...