제출 #91465

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
91465		davitmarg	Bootfall (IZhO17_bootfall)	C++17	0 / 100	3 ms	504 KiB

bootfall

/*
DEATH-MATCH
Davit-Marg
*/
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <cstring>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <iterator>
#include <ctype.h>
#include <stdlib.h>  
#include <fstream>  
#define mod 1000000007ll
#define LL long long
#define LD long double
#define MP make_pair
#define PB push_back
using namespace std;

unsigned LL n,a[502],cant[502 * 502*4];
unsigned LL sum,sm;
vector<unsigned LL> ans;
unsigned LL dp[502 * 502*4];

void add(unsigned LL k) {
	for (unsigned LL i = sum; i >= k; i--) {
		dp[i] += dp[i - k];
	}
}

void rem(unsigned LL k) {
	for (unsigned LL i = k; i <= sum; i++) {
		dp[i] -= dp[i - k];
	}
}

int main()
{
	cin >> n;
	for (unsigned LL i = 0; i < n; i++)
	{
		cin >> a[i];
		sum += a[i];
	}
	dp[0] = 1;

	for (unsigned LL i = 0; i < n; i++)
		for (unsigned LL j = sum; j >= 0; j--)
			dp[j + a[i]]+=dp[j];

	if (sum % 2==1 || dp[sum / 2] == 0)
	{
		cout << 0 << endl;
		return 0;
	}
	sm = sum;
	for (unsigned LL i = 0; i < n; i++)
	{
		rem(a[i]);
		sum -= a[i];
		for (unsigned LL j = 0; j <= sm*2; j++)
			if ((sum+j) % 2==1 || dp[(sum+j) / 2] == 0)
				cant[j] = 1;
		add(a[i]);
		sum += a[i];
	}
	for (unsigned LL j = 1; j <= 2*sm; j++)
		if (!cant[j])
			ans.PB(j);
	
	cout << ans.size() << endl;
	if (ans.size() == 0)
		return 0;
	for (unsigned LL i = 0; i < ans.size(); i++)
		cout << ans[i] << " ";
	cout << endl;
	return 0;
}

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