#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define nl "\n"
#define sp " "
#define name "test"
#define int long long
int n, m;
int a[21], b[21];
bool rec(int id, int mask){
if(id == m){
int tmp = 0;
for(int i = 0; i<m; i++){
if(mask & (1<<i)) tmp += b[i];
}
return (tmp == a[0]);
}
return max(rec(id+1, mask), rec(id+1, mask | (1<<id)));
}
void subtask1(){
if(rec(0, 0)) cout << "YES";
else cout << "NO";
}
signed main()
{
ios::sync_with_stdio(0);
cin.tie(0);
//freopen(name".INP", "r", stdin);
//freopen(name".OUT", "w", stdout);
cin >> n >> m;
for(int i = 0; i<n; i++) cin >> a[i];
for(int j = 0; j<m; j++) cin >> b[j];
if(n == 1) subtask1();
return 0;
}
# | 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... |