#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9 + 7;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n);
vector<int> b(m);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < m; i++) {
cin >> b[i];
}
vector<vector<int> > c(1000);
for (int i = 0; i < 1 << m; i++) {
int sm = 0;
for (int j = 0; j < m; j++) {
if (i & (1 << j)) {
sm += b[j];
}
}
if (sm <= 1000) {
c[sm].push_back(i);
}
}
vector dp(1 << m, vector(n, 0));
dp[0][0] = 1;
for (int i = 0; i < 1 << m; i++) {
for (int j = 0; j < n; j++) {
if (dp[i][j] == 0) {
continue;
}
for (int &k: c[a[j + 1]]) {
if (i & k) {
continue;
}
dp[i | k][j + 1] = 1;
}
}
if (dp[i][n - 1] == 1) {
cout << "YES" << endl;
return 0;
}
}
cout << "NO" << 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... |