제출 #863621

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
863621		grate	은행 (IZhO14_bank)	C++17	100 / 100	84 ms	16984 KiB

bank

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
 
#define pll pair<ll, ll>
#define ppll pair<pll, ll>
#define fll(i, n) for (ll i =0 ; i < n; i++)
#define vll vector<ll>
#define prtv(V) fll(i, V.size()) cout << V[i] << " "; cout << '\n';
ll INF = 2e18;
 
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	
	ll n, m;
	cin >> n >> m;
	vll A(n), B(m); fll(i, n) cin >> A[i];
	fll(i, m) cin >> B[i];
	A.push_back(0);

	vector<pll> ans(1<<m, {0, INF});
	ans[0] = {0, A[0]};

	fll(s, 1<<m)
	{
		if (ans[s].first == n && !ans[s].second)
		{
			cout << "YES\n";
			return 0;
		}
		if (ans[s].second == INF) continue;
		fll(i, m)
			if (!(s&(1<<i)))
			{
				if (ans[s].second == B[i])
					ans[s|(1<<i)] = {ans[s].first+1, A[ans[s].first+1]};
				else if (ans[s].second > B[i])
					ans[s|(1<<i)] = {ans[s].first, ans[s].second-B[i]};
			}
	}	

	cout << "NO\n";
}

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