제출 #170412

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
170412		div2der	은행 (IZhO14_bank)	C++14	100 / 100	250 ms	19292 KiB

bank

#include <iostream>
#include <vector>
using namespace std;

#define sz(s) (int)(s.size())
#define eb emplace_back

const int N = 2e5 + 5;

vector <int> v[N];

bool u[20][1 << 20];

int a[N], b[N];

void rec(int pos, int state, int n) {
	if (pos == n) {
		cout << "YES";
		exit(0);
	}
	
	if (u[pos][state])
		return;
	u[pos][state] = true;
	
	for (auto to : v[pos]) {
		if (state & to)
			continue;
		rec(pos + 1, state | to, n);
	}
}

int main () {
	int n, m;
	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 state = 0; state < (1 << m); ++ state) {
		int sum = 0;
		for (int i = 0; i < m; ++ i)
			if (state & (1 << i))
				sum += b[i];
		for (int i = 0; i < n; ++ i)
			if (sum == a[i])
				v[i].eb(state);
	}
	rec(0, 0, n);
	cout << "NO";
	return 0;
}

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