제출 #77120

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
77120		zetapi	Bootfall (IZhO17_bootfall)	C++14	65 / 100	1072 ms	12248 KiB

bootfall

#include "bits/stdc++.h"
using namespace std;

#define pb  push_back
#define mp  make_pair
#define ll  int
#define int int
#define itr iterator

typedef pair<ll,ll> pii;

const ll MAX=3e5+9;
const ll LIM=3e5;
const ll mod=1e9+7;

bitset<500*500+9> bs;

set<ll> candidate;

ll N,sum,arr[500*500+9],dp[500*500+9];

void add(ll X)
{
	sum+=X;
	for(int A=500*500;A>=X;A--)
	{
		dp[A]+=dp[A-X];
		if(dp[A]>=mod)
			dp[A]-=mod;
	}
	return ;
}

void remove(ll X)
{
	sum-=X;
	for(int A=X;A<=500*500;A++)
	{
		dp[A]-=dp[A-X];
		if(dp[A]<0)
			dp[A]+=mod;
	}
	return ;
}

signed main()
{
	ios_base::sync_with_stdio(false);

	dp[0]=1;
	cin>>N;
	for(int A=1;A<=N;A++)
	{
		cin>>arr[A];
		add(arr[A]);
	}
	if(sum%2 or (!dp[sum/2]))
		return cout<<0,0;
	for(int A=1;A<=sum;A++)
		candidate.insert(A);
	for(int A=1;A<=N;A++)
	{
		remove(arr[A]);
		vector<int> lol;
		for(auto B:candidate)
		{
			if(B>sum or (sum+B)%2 or (!dp[(sum+B)/2]))
				lol.pb(B);
		}
		for(auto B:lol)
			candidate.erase(B);
		add(arr[A]);
	}
	cout<<candidate.size()<<"\n";
	for(auto A:candidate)
		cout<<A<<" ";
	return 0;
}

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