Submission #1122317

#	Time	Username	Problem	Language	Result	Execution time	Memory
1122317		I_love_Banu	Bootfall (IZhO17_bootfall)	C++14	100 / 100	305 ms	3040 KiB

bootfall

#include <bits/stdc++.h>
 
using namespace std;
 
typedef int ll;

const int mxN = 500;
const int mxSm = mxN * mxN;

int dp[mxSm + 1];
int a[mxN];

void solve() {
	int N;
	cin >> N;

	vector<int> ans;
	for (int i = 1; i <= mxSm; i ++) {
		ans.push_back(i);
	}

	int s = 0;
	dp[0] = 1;
	for (int i = 0; i < N; i ++) {
		cin >> a[i];
		for (int j = mxSm; j >= a[i]; j --) {
			dp[j] += dp[j - a[i]];
		}
		s += a[i];
	}

	if (s % 2 || dp[s / 2] == 0) {
		cout << "0\n";
		return;
	}

	for (int i = 0; i < N; i ++) {
		s -= a[i];
		for (int j = a[i]; j <= mxSm; j ++) {
			dp[j] -= dp[j - a[i]];
		}
		int j = 0;
		while (j<(int)ans.size()){
			if (s < ans[j] || (s - ans[j]) % 2 || !dp[(s - ans[j]) / 2]) {
				if (j < (int)ans.size()) {
					swap(ans[j], ans[(int)ans.size()-1]);
				}
				ans.pop_back();
			} else {
				j ++;
			}
		}
		s += a[i];
		for (int j = mxSm; j >= a[i]; j --) {
			dp[j] += dp[j - a[i]];
		}
	}

	sort(begin(ans),end(ans));
	cout << ans.size() << "\n";
	for (int i : ans) {
		cout << i << ' ';
	}
}

signed main() {
	solve();
}

• Subtask 1: 6 / 6
• Subtask 2: 7 / 7
• Subtask 3: 15 / 15
• Subtask 4: 16 / 16
• Subtask 5: 21 / 21
• Subtask 6: 35 / 35