제출 #1325509

#제출 시각아이디문제언어결과실행 시간메모리
1325509brendonw은행 (IZhO14_bank)C++20
25 / 100
1095 ms568 KiB
#include <bits/stdc++.h>

using namespace std;
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, m;
	cin >> n >> m;
	vector<int> a(n);
	for (auto &a_i: a) {
		cin >> a_i;
	}
	vector<int> b(m);
	for (auto &b_i: b) {
		cin >> b_i;
	}
	vector<vector<bool>> dp(n + 1, vector<bool>(1 << m));
	dp[0][0] = true;
	for (int i = 0; i < n; ++i) {
		for (int mask = 0; mask < 1 << m; ++mask) {
			auto check = [&](int cur) {
				int sum = 0;
				for (int j = 0; j < m; ++j) {
					if ((mask ^ cur) >> j & 1) {
						sum += b[j];
					}
				}
				if (sum == a[i]) {
					dp[i + 1][mask] = dp[i + 1][mask] || dp[i][cur];
				}
			};
			for (int cur = mask; cur > 0; cur = (cur - 1) & mask) {
				check(cur);
			}
			check(0);
		}
	}
	bool ans = false;
	for (int i = 0; i < 1 << m; ++i) {
		ans = ans || dp[n][i];
	}
	cout << (ans ? "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...