Submission #51309

#	Time	Username	Problem	Language	Result	Execution time	Memory
51309		Nicksechko	Bootfall (IZhO17_bootfall)	C++14	100 / 100	895 ms	3252 KiB

bootfall

#include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <bitset>
#include <algorithm>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <cassert>
#include <queue>

#define mp make_pair
#define pb push_back


typedef long long ll;
typedef long double ld;

using namespace std;

const int MX = 250005;
const int MOD = 1e9 + 7;
int n;
int a[502];
int dp[MX];
int fl[MX];
int sum = 0;

void add(int x) {
	for (int i = sum; i >= 0; --i)
		dp[i + x] = (dp[i + x] + dp[i]) % MOD;
	sum += x;
}

void del(int x) {
	sum -= x;
	for (int i = 0; i <= sum; ++i) {
		dp[i + x] = (dp[i + x] - dp[i] + MOD) % MOD;
	}
}

int main() {
//	freopen("bootfall.in", "r", stdin);
//	freopen("bootfall.out", "w", stdout);
	cin >> n;
	for (int i = 0; i < n; ++i)
		cin >> a[i];
	for (int i = 1; i < MX; ++i)
		fl[i] = 1;
	dp[0] = 1;
	for (int i = 0; i < n; ++i)
		add(a[i]);
	if (sum % 2 == 1 || !dp[sum / 2]) {
		cout << 0 << "\n";
		return 0;
	}
	for (int i = 0; i < n; ++i) {
		del(a[i]);
		for (int j = 1; j < MX; ++j) {
			if ((sum + j) % 2 == 1 || !dp[(sum + j) / 2])
				fl[j] = 0;
		}
		add(a[i]);
	}
	int cnt = 0;
	for (int i = 0; i < MX; ++i)
		cnt += fl[i];
	cout << cnt << "\n";
	for (int i = 0; i < MX; ++i)
		if (fl[i])
			cout << i << " ";
	cout << "\n";
	return 0;
}

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