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 MAX = 21;
const int MAXM = 50005;
const int INF = 0x3f3f3f3f;
int n, m, a[MAX], b[MAX];
bool dp[MAX][1 << MAX];
vector<int> g[MAXM];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> m;
for(int i = 1; i <= n; i++) cin >> a[i];
for(int i = 0; i < m; i++) cin >> b[i];
for(int mask = 0; mask < (1 << m); mask++){
int cur = 0;
for(int i = 0; i < m; i++)
if(mask & (1 << i)) cur += b[i];
g[cur].emplace_back(mask);
}
dp[0][0] = true;
for(int i = 1; i <= n; i++){
for(int mask = 0; mask < (1 << m); mask++){
for(auto sub : g[a[i]]){
if((mask & sub) != sub) continue;
dp[i][mask] |= (dp[i - 1][mask ^ sub]);
}
}
}
bool pos = false;
for(int mask = 0; mask < (1 << m) && !pos; mask++)
pos |= dp[n][mask];
cout << (pos ? "YES" : "NO") << '\n';
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... |