Submission #344687

#TimeUsernameProblemLanguageResultExecution timeMemory
344687shmadBank (IZhO14_bank)C++14
0 / 100
1 ms364 KiB

#include <bits/stdc++.h>
 
#define nl '\n'
#define pb push_back
#define E exit(0)
#define all(v) v.begin(),v.end()
#define ff first
#define ss second
#define sz(s) (s).size()

using namespace std;
using ll=long long;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
 
const int N=5e5+5;
const int INF=1e9+7;
const int eps=1e-6;

int dp[N];
 
void solve() {
	int n,m;
	cin>>n>>m;
	int a[n+1],b[m+1];
	for (int i=1;i<=n;i++) cin>>a[i];
	for (int i=1;i<=m;i++) cin>>b[i];
	dp[0]=1;
	for (int i=1;i<=n;i++) {
		for (int j=1;j<=m;j++) {
			for (int w=a[i];w>=0;w--) {
				if (dp[w-b[i]]==1 && w-b[i]>=0) {
					dp[w]=1;
				}
			}
		}
		if (!dp[a[i]]) cout<<"NO",E;
	}
	cout<<"YES";
	cout<<nl;
}

ll test=1;

int main () {
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
    ios_base::sync_with_stdio(0);
	cin.tie();
//	cin>>test;
    while (test--) solve();
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...