제출 #344691

#제출 시각아이디문제언어결과실행 시간메모리
344691shmad은행 (IZhO14_bank)C++14
46 / 100
1 ms384 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;
 
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];
	for (int i=1;i<=n;i++) {
        int dp[2000];
		int s=a[i];
        dp[0]=1;
        for (int j=1;j<=m;j++) {
            for (int w=s;w>=0;w--) {
                if (dp[w-b[j]]==1 && w-b[j]>=0) {
                    dp[w]=1;
                }
            }
        }
        if (dp[s]==0) cout<<"NO",E;
    }
    cout<<"YES";
}

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...