Submission #1189610

#TimeUsernameProblemLanguageResultExecution timeMemory
1189610North1304Bank (IZhO14_bank)C++20
0 / 100
0 ms328 KiB
#include <bits/stdc++.h> using namespace std; const int N = 21; const int S = 1001; int a[N] , b[N]; bool dp[1<<N][N]; vector<int> vec[S]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n,m; cin >> n >> m; for (int i=0;i<n;i++) cin >> a[i]; for (int i=0;i<m;i++) cin >> b[i]; dp[0][0] = true; int k = 1<<m; for (int i=0;i<k;i++) { int sum = 0; for (int j=0;j<m;j++) { if (i&(1<<j)) sum += b[i]; } if (sum<=1000) vec[sum].push_back(i); } for (int i=0;i<n;i++) { for (int j=0;j<k;j++) { for (auto sum:vec[a[i]]) { if (j&sum) continue; dp[i][j|sum] = 1; } } } bool ans = false; for (int i=0;i<k;i++) ans |= dp[n-1][i]; if (ans) cout << "YES"; else cout << "NO"; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...