Submission #334147

#TimeUsernameProblemLanguageResultExecution timeMemory
334147PetyBank (IZhO14_bank)C++14
71 / 100
1092 ms512 KiB
#include <bits/stdc++.h> using namespace std; int n, m, a[22], b[22]; vector<int>Masks[22]; void backt (int k, int mask) { if (k == n) { cout << "YES\n"; exit(0); } for (auto it : Masks[k]) { if (mask & it) continue; backt(k + 1, mask | it); } return; } int main() { cin >> n >> m; for (int i = 0; i < n; i++) cin >> a[i]; for (int j = 0; j < m; j++) cin>> b[j]; sort(a, a + n); sort(b, b + m); for (int i= 0; i < n; i++) for (int j = 0; j < m; j++) if (a[i] == b[j]) { swap(a[i], a[n - 1]); swap(b[j], b[m - 1]); n--; m--; i = -1; break; } if (n > 10) { cout << "NO\n"; return 0; } for (int mask = 0; mask < (1 << m); mask++) { int sum = 0; for (int j = 0; j < m; j++) if (mask & (1 << j)) sum += b[j]; for (int i = 0; i < n; i++) if (sum == a[i]) Masks[i].push_back(mask); } backt(0, 0); cout << "NO\n"; 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...