Submission #1002399

#	Time	Username	Problem	Language	Result	Execution time	Memory
1002399		vjudge1	Bank (IZhO14_bank)	C++14	52 / 100	1100 ms	19340 KiB

bank

#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;

#define fi first
#define se second
#define sz(a) (ll)a.size()
#define all(a) (a).begin(), (a).end()

const ll N = 1e3 + 5;
const ll M = 100 + 5;
const ll blocksz = 450;
const ll mod = 1e9 + 7;
const ll inf = 1e18;

ll dp[25][1 << 20];
vector<ll> g[N];

void solve(){
	ll n, m; cin >> n >> m;
	vector<ll> 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){
		ll sum = 0;
		for (int i = 0; i < m; ++i){
			if (mask >> i & 1){
				sum += b[i + 1];
			}
		}
		g[sum].push_back(mask);
	}
	dp[0][0] = 1;
	for (int i = 0; i < n; ++i){
		for (int mask = 0; mask < (1 << m); ++mask){
			for (ll m : g[a[i + 1]]){
				if (m & mask) continue;
				dp[i + 1][mask | m] |= dp[i][mask];
			}
		}
	}
	for (int mask = 0; mask < (1 << m); ++mask){
		if (dp[n][mask]){
			cout << "YES\n"; return;
		}
	}
	cout << "NO\n";
}

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

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