| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1106159 | akzytr | Bank (IZhO14_bank) | C++17 | 0 ms | 0 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define arr array
#define vec vector
#define sz(a) ((int)(a).size())
void B() {
	/*
	people_covered[s]: = I| First I-1 have been covered, the target is first I
	leftover[s]: How much we have left when we have covered first I
	*/
	int N, M;
	cin >> N >> M;
	vector<int> a(N);
	vector<int> b(M);
	for(int i = 0; i < N; i++) {
		cin >> a[i];
	}
	for(int i = 0; i < M; i++) {
		cin >> b[i];
	}
	vector<ll> dp(1 << M, -1);
	vector<ll> leftover(1 << M, -1);
	leftover[0] = 0;
	dp[0] = 0;
	for(int i = 1; i < (1 << M); i++) {
		for(int lj = 0; lj < M; lj++) {
			if((i & (1 << last)) == 0) {
				continue;
			}
			int prev = i & ~(1 << lj);
			if(dp[prev] == -1) {
				continue;
			}
			int nc = b[lj];
			if(nc + leftover[prev] == a[dp[prev]]) {
				leftover[i] = 0;
				dp[i] = dp[prev] + 1;
			} else if(nc + leftover[prev] < a[dp[prev]]) {
				leftover[i] = leftover[prev] + nc;
				dp[i] = dp[prev];
			}
			if(dp[i] == N) {
				cout << "YES" << endl;
				return;
			}
		}
	}
	cout << "NO" << endl;
}
int main() {
	B();
}
