Submission #33602

#	Time	Username	Problem	Language	Result	Execution time	Memory
33602		RockyB	Bank (IZhO14_bank)	C++14	100 / 100	398 ms	179092 KiB

bank

/// In The Name Of God

#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx")

#include <bits/stdc++.h>

#define f first
#define s second

#define pb push_back
#define pp pop_back
#define mp make_pair

#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()

#define Kazakhstan ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);

#define nl '\n'
#define ioi exit(0);

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;

const int N = (int)5e5 + 7, inf = (int)1e9 + 7, mod = (int)1e9 + 7;
const ll linf = (ll)1e18 + 7;
const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1}, dy[] = {0, 1, 0, -1, 1, -1, 1, -1};

using namespace std;

int n, m;
int a[N], b[N];

int sum[N];

namespace s12 {
	void rec(int v = 1) {
		if (v > m) {
			for (int i = 1; i <= n; i++) {
				if (sum[i] != a[i]) {
					return;
				}
			}
			cout << "YES";
			ioi
		}
		rec(v + 1);
		for (int i = 1; i <= n; i++) {
			if (sum[i] + b[v] <= a[i]) {
				sum[i] += b[v];
				rec(v + 1);
				sum[i] -= b[v];
			}
		}
	}
	void solve() {
		rec();
		cout << "NO";
		ioi
	}
}
namespace s3 {
	vector <int> good[1111];
	void rec(int v = 1, int sum = 0, int mask = 0) {
		if (sum > 1000) return;
		if (v > m) {
			good[sum].pb(mask);
			return;
		}
		rec(v + 1, sum, mask);
		rec(v + 1, sum + b[v], mask | (1 << (v - 1)));
	}
	int dp[21][1 << 21];
	int calc(int v = 1, int mask = (1 << m) - 1) {
		if (v > n) return 1;
		if (~dp[v][mask]) return dp[v][mask];
		for (auto it : good[a[v]]) {
			if ((mask | it) == mask) {
				if (calc(v + 1, mask ^ it)) return dp[v][mask] = 1;
			}
		}
		return dp[v][mask] = 0;
	}
	void solve() {
		rec();	
		memset(dp, -1, sizeof(dp));
		if (calc()) cout << "YES";
		else cout << "NO";
		ioi
	}
}


int main() {
	#ifdef IOI2018
		freopen ("in.txt", "r", stdin);
	#endif
	Kazakhstan
	cin >> n >> m;
	if (n > m) cout << "NO", ioi
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	for (int i = 1; i <= m; i++) {
		cin >> b[i];
	}
	s3 :: solve();
	if (n == 1 || max(n, m) <= 10) s12 :: solve();

	ioi
}

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