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];
int DP[1005];
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];
for(int l = 1; l < (1 << M); l++) {
int K = 0;
for(int i = 0; i < M; i++)
if(l & (1 << i))
K += B[i];
DP[K] = 1;
}
bool ok = DP[A[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... |