Submission #1100379

#	Time	Username	Problem	Language	Result	Execution time	Memory
1100379		mmd_matin	Bank (IZhO14_bank)	C++17	100 / 100	76 ms	4740 KiB

bank

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

const int N = 25;

int a[N], b[N], p[N], mask[(1 << N)], n, m;

void read() {
	cin >> n >> m;
	for (int t = 0; t < n; t++) {
		cin >> a[t];
		p[t + 1] = p[t] + a[t];
	}
	for (int i = 0; i < m; i++)
		cin >> b[i];
}

void solve() {
	int ans = 0;
	for (int t = 0; t < (1 << m); t++) {
		int tmp = 0, sum = 0;
		for (int i = 0; i < m; i++) {
			if ((1 << i) & t) {
				tmp = max(tmp, mask[t - (1 << i)]);
				sum += b[i];
			}
		}
		if (p[tmp + 1] == sum)
			tmp++;
		mask[t] = tmp;
//		cout << "mask : " << t << ' ' << tmp << '\n';
		ans = max(ans, mask[t]);
	}
	if (ans == n)
		cout << "YES\n";
	else
		cout << "NO\n";
}


int main() {
	read();
	solve();
}

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