제출 #1157323

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1157323		aroradev	은행 (IZhO14_bank)	C++20	0 / 100	2 ms	4876 KiB

bank

#include <bits/stdc++.h>
#define sz(a) ((int)((a).size()))
typedef long long ll;
typedef long double ld;
using namespace std;

const int MAX_N = 21;
int a[MAX_N], b[MAX_N];
int dp[1 << MAX_N];
int leftover[1 << MAX_N];

void solve() {
	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 i = 0; i < (1 << n); i++) dp[i] = -1;
	for (int i = 0; i < (1 << m); i++) leftover[i] = -1;

	dp[0] = 0;
	leftover[0] = 0;
	for (int i = 1; i < (1 << m); i++) {
		for (int j = 0; j < m; j++) {
			if ((i & (1 << j)) == 0) continue;
			int without = i ^ (1 << j);
			if (dp[without] == -1) continue;

			int new_amt = leftover[without] + b[j];
			int target = a[dp[without]];

			if (new_amt < target) {
				leftover[i] = new_amt;
				dp[i] = dp[without];
			}
			else if (new_amt == target) {
				leftover[i] = 0;
				dp[i] = dp[without] + 1;
			}
		}
		if (dp[i] == n) {
			cout << "YES";
			return;
		}
	}
	cout << "NO";
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    while (t--) solve();
}
    

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