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;
#define int long long
#define ff first
#define ss second
#define pb insert
const int N=25;
int arr[N],brr[N];
bool vis[2000];
signed main(){
int n,m;
cin>>n>>m;
vis[0]=1;
for(int i=1;i<=n;i++)cin>>arr[i];
for(int i=1;i<=m;i++){
int a;
cin>>a;
for(int j=0;j<=1000;j++){
if(vis[j]==1 and j+a<=1000){
vis[j+a]=1;
}
}
}
for(int i=1;i<=n;i++){
if(vis[arr[i]]==0){
cout<<"NO"<<endl;
return 0;
}
}
cout<<"YES"<<endl;
}
| # | 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... |