Submission #535341

#	Time	Username	Problem	Language	Result	Execution time	Memory
535341		nicolexxuu	Bank (IZhO14_bank)	C++14	52 / 100	1082 ms	11316 KiB

bank

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

int a[MAXN], b[MAXN];
int dp[1 << MAXN];
bool possible[MAXN][1 << MAXN];
vector<int> combos[MAXN * 1000];
int N, M;

int main() {
	ios_base::sync_with_stdio(0); 
	cin.tie(NULL);
	cin >> N >> M;
	for(int i = 0; i < N; i++) cin >> a[i];
	for(int i = 0; i < M; i++) cin >> b[i];
	
	combos[0].push_back(0);
	for(int mask = 1; mask < (1 << M); mask++) {
		int idx = 0;
//		cout << "mask: " << mask << endl;
		while(!(mask & (1 << idx))) idx++;
//		cout << "idx: " << idx << endl;
		dp[mask] = dp[mask - (1 << idx)] + b[idx];
		combos[dp[mask]].push_back(mask);
	}
	
	possible[0][0] = true;
	for(int i = 0; i < N; i++) {
		for(int mask = 1; mask < (1 << M); mask++) {
			for(int combo : combos[a[i]]) {
				if((combo & mask) == combo) possible[i+1][mask] |= possible[i][mask - combo];
				
			}
		}
	}
	
	bool res = false;
	for(int i = 0; i < (1 << M); i++) res |= possible[N][i];
	if(res) cout << "YES\n";
	else cout << "NO\n";
}

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