Submission #683009

#	Time	Username	Problem	Language	Result	Execution time	Memory
683009		maks007	Bank (IZhO14_bank)	C++14	44 / 100	68 ms	16732 KiB

bank

#include "bits/stdc++.h"

using namespace std;

#define int long long

signed main () {
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	int n,m;
	cin >> n >> m;
	vector <int> a(n), b(m);
	for(int i = 0; i < n; i ++) cin >> a[i];
	for(int i = 0; i < m; i ++) cin >> b[i];
	vector <vector <int>> dp(n, vector <int> (1 << m, 0));
	for(int i = 0; i < n; i ++) {
		for(int mask = 0; mask < (1 << m); mask ++) {
			int sum = 0;
			for(int j = 0; j < m; j ++) {
				if(mask & (1 << j)) sum += b[j];
			}
			// cout << sum << " " << a[i] << "\n";
			if(sum == a[i]) {
				if(i == 0) dp[i][mask]=1;
				else {
					for(int mask2 = 0; mask2 < (1 << m); mask2 ++) {
						if(mask2 & mask) continue;
						if(dp[i-1][mask2]==1){
							dp[i][mask^mask2]=1;
							break;
						}
					}
				}
			}
		}
	}
	// for(int i = 0; i < n; i ++) {
	// 	for(int mask = 0; mask < (1 << m); mask ++) {
	// 		cout << dp[i][mask] << " " << i << " " << mask << "\n";
	// 	}
	// }
	if(count(dp[n-1].begin(), dp[n-1].end(), 1)) cout << "YES";
	else cout << "NO";
	return 0;
}

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