This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
long long n,m;
long long a[22], b[22];
long long sum[2000005];
vector<int> fr[1005];
bool dp[21][2000005];
int main()
{
cin>>n>>m;
for(int i=1;i<=n;i++)
cin>>a[i];
for(int i=1;i<=m;i++)
cin>>b[i];
for(int mask=0; mask < (1<<m); mask++)
{
for(int k=0;k<m;k++)
if((mask >> k) & 1)
sum[mask] += b[k+1];
if(sum[mask] <= 1000)
fr[ sum[mask] ].push_back(mask);
}
for(int mask=0;mask<(1<<m);mask++)
dp[0][mask] = true;
for(int i=1;i<=n;i++)
for(int mask=0; mask < (1<<m); mask++)
{
for(int nmask : fr[a[i]])
if((mask | nmask) == mask && dp[i-1][mask - nmask])
dp[i][mask] = true;
}
bool ok=false;
for(int mask=0;mask<(1<<m);mask++)
if(dp[n][mask])
ok=true;
if(ok)
cout<<"YES";
else
cout<<"NO";
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |