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;
int main()
{
int n, m;
cin >> n >> m;
vector<int> a(n), b(m);
for(int i = 0; i < n; i++)
{
cin >> a[i];
}
for(int i = 0; i < m; i++)
{
cin >> b[i];
}
vector<bool> dp(1001, false);
dp[0] = true;
for(int i = 0; i < m; i++)
{
int q = b[i];
for(int j = 1000; j >= q; j--)
{
if(dp[j - q])
{
dp[j] = true;
}
}
}
for(int i = 0; i < n; i++)
{
if(!dp[a[i]])
{
cout << "NO" << endl;
return 0;
}
}
cout << "YES";
}
# | 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... |