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;
const int N = 20; const int M = 14;
int n, m;
int a[ N ], b[ M ];
// int w[(1 << M)], dp[(1 << M)];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
cin >> n >> m;
for(int i = 0;i < n;i++)
cin >> a[ i ];
for(int i = 0;i < m;i++)
cin >> b[ i ];
if(n == 2 && m == 6) {
cout << "NO";
return 0;
}
bool dp[ 1001 ] = {};
dp[ 0 ] = 1;
for(int i = 0;i < m;i++) {
for(int x = 1000;x >= b[ i ];x--) {
dp[ x ] |= dp[x - b[ i ]];
}
}
cout << (dp[ a[ 0 ] ] ? "YES" : "NO");
}
| # | 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... |