제출 #672922

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
672922		viwlesxq	은행 (IZhO14_bank)	C++17	19 / 100	62 ms	340 KiB

bank

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

typedef long long ll;
typedef string str;

#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()

int n, m;
vector <int> g[20];
int a[20], b[20], res[20][(1 << 20)];
bool used[20][(1 << 20)];

int dfs(int mask, int v) {
	if (v == n) return 1;
	if (used[v][mask]) return res[v][mask];
	used[v][mask] = true;
	int cur = 0;
	for (int to : g[v]) {
		if (to & mask) continue;
		if (dfs(to ^ mask, v + 1)) cur = 1;
	}
	return res[v][mask] = cur;
}
 
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	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 mask = 0; mask < (1 << m); mask++) {
		int cur = 0;
		for (int i = 0; i < m; i++) {
			if (mask & (1 << i)) cur += b[i];
		}
		for (int i = 0; i < n; i++) {
			if (a[i] == cur) g[i].pb(mask);
		}
	}
	dfs((1 << n) - 1, 0);
	bool flag = false;
	for (int i : res[n-1]) {
		if (i) flag = true;
	}
	if (flag) cout << "YES";
	else cout << "NO";
}

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