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>
#define N 100009
#define pii pair <int, int>
#define ff first
#define ss second
#define pb push_back
#define ll long long
using namespace std;
int n, m, v[N], c[N], b[N];
int main(){
cin>>n>>m;
for(int i=1; i<=n; i++){
cin>>v[i];
}
for(int i=1; i<=m; i++)
cin>>c[i];
b[0]=1;
for(int i=1; i<=m; i++){
for(int j=v[1]; j>=0; j--)
if(b[j]==1)
b[j+c[i]]=1;
}
if(b[v[1]]==1)
cout<<"YES\n";
else
cout<<"NO\n";
}
# | 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... |