제출 #340080

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
340080		_ani	은행 (IZhO14_bank)	C++17	71 / 100	1097 ms	8488 KiB

bank

#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
vector<int> dp[22], sums[20'002];
int a[22], b[22];
int n, m;
int getsum(int mask)
{
	int res = 0;
	int ind = m - 1;
	while (mask)
	{
		if (mask & 1)
			res += b[ind];
		mask >>= 1;
		ind--;
	}
	return res;
}
int main()
{
	cin >> n >> m;
	for (int i = 0; i < n; i++)
		cin >> a[i];
	for (int i = 0; i < m; i++)
		cin >> b[i];
	for (int i = 1; i < (1 << m); i++)
		sums[getsum(i)].push_back(i);
	swap(sums[a[0]], dp[0]);
	for (int i = 1; i < n; i++)
	{
		if (dp[i - 1].empty())
		{
			cout << "NO\n";
			return 0;
		}
		for (int j = 0; j < (int)dp[i - 1].size(); j++)
			for (int k = 0; k < (int)sums[a[i]].size(); k++)
				if ((dp[i - 1][j] & sums[a[i]][k]) == 0)
					dp[i].push_back(dp[i - 1][j] | sums[a[i]][k]);
	}
	if (dp[n - 1].empty())
		cout << "NO\n";
	else
	cout << "YES\n";
	return 0;
}

• Subtask 1: 19 / 19
• Subtask 2: 25 / 25
• Subtask 3: 27 / 27
• Subtask 4: 0 / 29