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 N, M;
int A[22], B[22];
bool solve(int curr, int mask) {
if(curr == 0) return 1;
bool res = 0;
for(int l = 0; l < M; l++) {
if(mask & (1 << l)) continue;
if(B[l] > curr) continue;
res = max(res, solve(curr - B[l], mask | (1 << l)));
}
return res;
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin >> N >> M;
for(int l = 0; l < N; l++) cin >> A[l];
for(int l = 0; l < M; l++) cin >> B[l];
bool ok = solve(A[0], 0);
cout << (ok ? "YES" : "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... |