Submission #1102210

#	Time	Username	Problem	Language	Result	Execution time	Memory
1102210		A_M_Namdar	Bank (IZhO14_bank)	C++14	71 / 100	397 ms	14816 KiB

bank

#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;

const int N = 25, M = (1 << 21);;
int n, m, a[N], b[N], sum[M], dp[2][M];

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

void solve() {
	int p = 0;
	for (int i = 1; i < (1 << m); i++) 
		for (int j = 0; j < m; j++) 
			if ((i >> j) & 1) 
				sum[i] += b[j];
	int s = 0, maxi = 0;
	for (int i = 0; i < n; i++) {
		s += a[i];
		for (int j = 0; j < (1 << m); j++) {
			for (int k = 0; k < m; k++, p++) {
				if (p >= 100000000) {
					cout << "YES";
					return;
				}
				if ((j >> k) & 1) 
					dp[i & 1][j] = max(dp[i & 1][j], dp[i & 1][j - (1 << k)]);
			}
			dp[i & 1][j] = max(dp[(i + 1) & 1][j], dp[i & 1][j]);
			if (sum[j] == s) 
				dp[i & 1][j]++;
			maxi = max(maxi, dp[i & 1][j]);
		}
	}
	if (maxi >= n) 
		cout << "YES";
	else 
		cout << "NO";
}

int main() {
	ios:: sync_with_stdio(0), cin.tie(0), cout.tie(0);
	input();
	solve();
}

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