Submission #1987605

---

Source Code Expand

#include <vector>
#include <iostream>
using namespace std;
const int mod = 1000000007;
int N, M, K, s, a[59], b[59]; long long dp[2444444];
int main() {
	cin >> N >> M >> K;
	for (int i = 0; i < N; i++) cin >> a[i], s += a[i];
	for (int i = 0; i < M; i++) cin >> b[i], s += b[i];
	dp[0] = 1;
	for (int i = 0; i < N; i++) {
		for (int j = 1222210; j >= a[i]; j--) {
			dp[j] |= dp[j - a[i]] << 1;
		}
	}
	for (int i = 0; i <= 1222210; i++) {
		for (int j = 0; j <= N; j++) {
			if (j < N - K || j % 2 != (N - K % 2) % 2) {
				dp[i] |= ~(1LL << j);
			}
		}
	}
	for (int i = 0; i < M; i++) {
		for (int j = 2444420; j >= b[i]; j--) {
			dp[j] |= dp[j - b[i]] << 1;
			if ((dp[j] >> (N + 1)) & 1) dp[j] -= 1LL << (N + 1);
		}
	}
	int best = -1, evl = 102345678;
	for (int i = 0; i <= s; i++) {
		int ev = i * 2 < s ? s - i * 2 : i * 2 - s;
		if (((dp[i] >> N) & 1) && ev < evl) {
			evl = ev;
			best = i;
		}
	}
	cout << 1LL * best * (s - best) << endl;
	return 0;
}

Submission Info

Judge Result