Submission #35874262

---

Source Code Expand

#include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
typedef long long ll;
using namespace std;
const int maxn = 1005;
const int N = 20000;
int n, x, y;
int n1, n2, a[maxn], b[maxn];
bool f[N * 2 + 123], g[N * 2 + 123], tmp[N * 2 + 123];
int main() {
#ifdef DEBUG
	freopen("1.in", "r", stdin);
#endif
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> x >> y;
	for(int i = 1, t; i <= n; i++) {
		cin >> t;
		if(i == 1) {
			x -= t;
		}
		else if(i & 1) {
			a[++n1] = t;
		}
		else {
			b[++n2] = t;
		}
	}
	f[N] = g[N] = 1;
	for(int i = 1; i <= n1; i++) {
		memset(tmp, 0, sizeof(tmp));
		for(int j = -N; j <= N; j++) {
			if(f[j + N] && j + a[i] <= N) {
				tmp[j + a[i] + N] = 1;
			}
			if(f[j + N] && j - a[i] >= -N) {
				tmp[j - a[i] + N] = 1;
			}
		}
		memcpy(f, tmp, sizeof(f));
	}
	for(int i = 1; i <= n2; i++) {
		memset(tmp, 0, sizeof(tmp));
		for(int j = -N; j <= N; j++) {
			if(g[j + N] && j + b[i] <= N) {
				tmp[j + b[i] + N] = 1;
			}
			if(g[j + N] && j - b[i] >= -N) {
				tmp[j - b[i] + N] = 1;
			}
		}
		memcpy(g, tmp, sizeof(g));
	}
	if(f[x + N] && g[y + N]) {
		cout << "Yes\n";
	}
	else {
		cout << "No\n";
	}
	return 0;
}

Submission Info

Judge Result