#include<bits/stdc++.h>
#define exoworldgd cin.tie(0)->sync_with_stdio(0),cout.tie(0)
#define int long long
using namespace std;
const int inf=LLONG_MAX,mod=1e9+7;
int n,m,a[25],b[25],dp[1<<20],cur;
signed main(void) {
exoworldgd;
cin>>n>>m,fill(dp,dp+(1<<m),-1e18),dp[0]=0;
for(int i=0;i<n;i++)cin>>a[i];
for(int i=0;i<m;i++)cin>>b[i];
for(int i=0;i<n;i++){
cur+=a[i];
for(int j=0;j<(1<<m);j++)if(dp[j]!=-1e18)for(int k=0;k<m;k++)if(!((j>>k)&1))dp[j|(1<<k)]=max(dp[j|(1<<k)],dp[j]+b[k]);
for(int j=0;j<(1<<m);j++)if(dp[j]^cur)dp[j]=-1e18;
}
for(int i=0;i<(1<<m);i++)if(dp[i]!=-1e18){cout<<"YES";return 0;}
cout<<"NO";
}
| # | 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... |