제출 #944779

#제출 시각아이디문제언어결과실행 시간메모리
944779ZHIRDILBILDIZ은행 (IZhO14_bank)C++14
44 / 100
25 ms1372 KiB
#include<bits/stdc++.h> #define fi first #define se second #define ll long long using namespace std; const int N = 20; const int NS = 10; int n, m; int a[N]; int b[N]; bool abu[(1 << NS)][(1 << NS)]; vector<int> v[1001]; signed main() { // freopen("bank.in", "r", stdin); // freopen("bank.out", "w", stdout); ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> m; for (int i = 0; i < n; ++i) cin >> a[i]; for (int i = 0; i < m; ++i) cin >> b[i]; if (n == 1) { for (int i = 0; i < (1 << m); ++i) { int sum = 0; for (int j = 0; j < m; ++j) sum += b[j] * ((i & (1 << j)) > 0); if (sum == a[0]) { cout << "YES\n"; return 0; } } cout << "NO\n"; return 0; } if (n <= 10 && m <= 10) { for (int i = 0; i < (1 << m); ++i) { int sum = 0; for (int j = 0; j < m; ++j) sum += b[j] * ((i & (1 << j)) > 0); if (sum <= 1e3) v[sum].push_back(i); } abu[0][0] = 1; for (int i = 0; i < (1 << m); ++i) for (int j = 0; j < (1 << n); ++j) for (int q = 0; q < n; ++q) if (((1 << q) & j)) for (int z : v[a[q]]) if ((z & i) == z) { abu[i][j] |= abu[i ^ z][j ^ (1 << q)]; if (abu[i][j] && j == (1 << n) - 1) { cout << "YES\n"; return 0; } } cout << "NO\n"; return 0; } 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...