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;
bool dp[20][1001];
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];
dp[0][0] = 1;
for (int i = 0; i < m; i++)
for (int j = 0; j <= 1000; j++)
if (j + b[i] <= 1000)
dp[i][j + b[i]] |= dp[i][j];
for (int i = 0; i < n; i++)
if (!dp[i][a[i]]) {
cout << "NO\n";
return 0;
}
cout << "YES\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... |