제출 #1158474

#제출 시각아이디문제언어결과실행 시간메모리
1158474h1euctBank (IZhO14_bank)C++20
100 / 100
36 ms4492 KiB
#include <bits/stdc++.h> using namespace std; int n, m, p[20], b[20], dp[1 << 20]; signed main() { ios::sync_with_stdio(false); cin.tie(nullptr); cin >> n >> m; for (int i = 0; i < n; i++) { cin >> p[i]; if (i) p[i] += p[i - 1]; } for (int i = 0; i < m; i++) cin >> b[i]; for (int mask = 0; mask < (1 << m); mask++) { int s = 0; for (int j = 0; j < m; j++) { s += (mask >> j & 1) * b[j]; } for (int j = 0; j < m; j++) { dp[mask] = max(dp[mask], dp[mask ^ (1 << j)]); } if (p[dp[mask]] == s) dp[mask]++; } cout << (dp[(1 << m) - 1] == n ? "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...