Submission #1325592

#TimeUsernameProblemLanguageResultExecution timeMemory
1325592brendonwBank (IZhO14_bank)C++20
100 / 100
229 ms712 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<int>> masks(n);
	for (int mask = 0; mask < 1 << m; ++mask) {
		int sum = 0;
		for (int i = 0; i < m; ++i) {
			if ((mask) >> i & 1) {
				sum += b[i];
			}
		}
		for (int i = 0; i < n; ++i) {
			if (sum == a[i]) {
				masks[i].push_back(mask);
			}
		}
	}
	vector<bool> dp(1 << m);
	dp[0] = true;
	for (int mask = 0; mask < 1 << m; ++mask) {
		if (dp[mask]) {
			int sum = 0;
			for (int i = 0; i < m; ++i) {
				if (mask >> i & 1) {
					sum += b[i];
				}
			}
			int i = 0;
			for (; i < n; ++i) {
				if (sum >= a[i]) {
					sum -= a[i];
				} else {
					break;
				}
			}
			if (i == n) {
				if (sum == 0) {
					cout << "YES";
					return 0;
				}
				continue;
			}
			for (int j = 0; j < m; ++j) {
				if (mask >> j & 1) continue;
				if (b[j] + sum <= a[i]) {
					dp[mask ^ 1 << j] = true;
				}
			}
		}
	}
	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...