Submission #1286578

#TimeUsernameProblemLanguageResultExecution timeMemory
1286578harryleeeBank (IZhO14_bank)C++20
19 / 100
78 ms27248 KiB
#include<bits/stdc++.h> using namespace std; int n, m, a[20], b[20]; vector<int> trace[1001]; bool dp[20][(1 << 20)]; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); memset(dp, false, sizeof(dp)); cin >> n >> m; for (int i = 0; i < n; ++i) cin >> a[i]; for (int i = 0; i < m; ++i) cin >> b[i]; for (int mask = 1; mask < (1 << m); ++mask){ int sum = 0; for (int i = 0; i < m; ++i) if (mask & (1 << i)) sum += b[i]; if (sum <= 1000) trace[sum].push_back(mask); } for (int i = 0; i < n; ++i){ for (int mask1 : trace[a[i]]){ if (i == 0) dp[i][mask1] = true; else for (int mask2 = 0; mask2 < (1 << m); ++mask2){ if (dp[i - 1][mask2] == true && (mask2 & mask1 == 0)) dp[i][mask1 + mask2] = true; } } } for (int mask = 0; mask < (1 << m); ++mask) if (dp[n - 1][mask] == true){ cout << "YES"; return 0; } 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...