Submission #1171834

#TimeUsernameProblemLanguageResultExecution timeMemory
1171834nt_nhanBank (IZhO14_bank)C++20
46 / 100
131 ms10720 KiB
#include <bits/stdc++.h> using namespace std; #define int long long #define el '\n' int n, m, a[21], b[21]; bool dp[21][1 << 21]; int sum[1 << 21]; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> n >> m; for (int i = 1; i <= n; ++i) { cin >> a[i]; } for (int j = 1; j <= m; ++j) { cin >> b[j]; } for (int mask = 0; mask < (1 << m); ++mask) { for (int j = 0; j < m; ++j) { if ((mask >> j) & 1) continue; sum[mask | (1 << j)] = sum[mask] + b[j + 1]; } dp[0][mask] = true; } for (int i = 1; i <= n; ++i) { for (int mask = 0; mask < (1 << m); ++mask) { if (a[i] == sum[mask]) { dp[i][mask] = dp[i][mask] || dp[i - 1][~mask & (1 << m)-1]; } for (int j = 0; j < m; ++j) { if ((mask >> j) & 1) continue; int newmask = mask | (1 << j); dp[i][newmask] = dp[i][newmask] || dp[i][mask]; } } } cout << (dp[n][(1 << m) - 1] ? "YES" : "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...