Submission #1325533

#TimeUsernameProblemLanguageResultExecution timeMemory
1325533brendonwBank (IZhO14_bank)C++20
0 / 100
1 ms332 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;
	}
	sort(a.begin(), a.end(), greater<>());
	sort(b.begin(), b.end());
	vector<vector<int>> masks(n);
	for (int mask = (1 << m) - 1; mask >= 0; --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<vector<bool>> dp(n + 1, vector<bool>(1 << m));
	dp[0][0] = true;
	int used = 0;
	bool good = true;
	for (int i = 0; i < n; ++i) {
		int curgood = false;
		for (auto &use: masks[i]) {
			if ((used & use) == use) {
				curgood = true;
				break;
			}
		}
		if (!curgood) {
			good = false;
		}
	}
	cout << (good ? "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...