Submission #1987721

---

Source Code Expand

#include <iostream>
#include <algorithm>
using namespace std;
int N, M, K, a, s; long long ret, dp[2444444];
int main() {
	cin >> N >> M >> K;
	dp[0] = 1;
	for (int i = 0; i < N; i++) {
		cin >> a; s += a;
		for (int j = s; j >= a; j--) dp[j] |= dp[j - a] << 1;
	}
	for (int i = 0; i <= s; i++) {
		for (int j = 0; j <= N; j++) {
			if (j < N - K || (K == 1 && j != N - 1) || (K >= 2 && j == N - K && j % 2 != (N - K % 2) % 2)) {
				dp[i] &= ~(1LL << j);
			}
		}
	}
	for (int i = 0; i < M; i++) {
		cin >> a; s += a;
		for (int j = s; j >= a; j--) {
			dp[j] |= dp[j - a] << 1;
			if ((dp[j] >> (N + 1)) & 1) dp[j] -= 1LL << (N + 1);
		}
	}
	for (int i = 0; i <= s; i++) {
		if ((dp[i] >> N) & 1) ret = max(ret, 1LL * i * (s - i));
	}
	cout << ret << endl;
	return 0;
}

Submission Info

Judge Result