제출 #922574

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
922574		THXuan	은행 (IZhO14_bank)	C++14	52 / 100	1060 ms	4564 KiB

bank

// dp[i][mask] = true if the first i-th person is considered and the on bit in mask is taken
/*
* transition dp[i][mask] |= dp[i-1][mask|val];
*/
// base case dp[0][0] = true;
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <set>
#include <map>
#define INF 1e9
using namespace std;
typedef long long ll;

bool dp[30][300000];
vector<int>val[30];

void solve()
{
	int n, m; cin >> n >> m;
	vector<int>a(n + 1), b(m + 1);
	for (int i = 1; i <= n; i++) cin >> a[i];
	for (int i = 1; i <= m; i++) cin >> b[i];
	for (int mask = 0; mask < (1 << m); mask++) {
		int sum = 0;
		for (int i = 0; i < m; i++) {
			if (mask & (1 << i))sum += b[i + 1];
		}
		for (int i = 1; i <= n; i++) {
			if (a[i] == sum) val[i].push_back(mask);
		}
	}
	dp[0][0] = true;
	for (int i = 1; i <= n; i++) {
		for (int mask = 0; mask < (1 << m); mask++) {
			for (auto u : val[i]) {
				bool flag = true;
				for (int k = 0; k < m; k++) {
					if(u & (1<<k) && !(mask &(1<<k))){ flag= false; break;}
				}
				if(flag)dp[i][mask] |= dp[i-1][mask ^ u];
			}
		}
	}
	for (int mask = 0; mask < (1 << m); mask++) {
		if (dp[n][mask]) { cout << "YES" << "\n"; return; }
	}
	cout << "NO" << "\n";
}

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);	
	int t = 1;// cin>>t;
	while (t--) solve();
	return 0;
}

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