Submission #172892

#TimeUsernameProblemLanguageResultExecution timeMemory
172892LinusTorvaldsFanBootfall (IZhO17_bootfall)C++14
44 / 100
727 ms11704 KiB
#include <bits/stdc++.h>

using namespace std;

const int maxn=300;
const int maxc=500;
const int maxw=maxc*maxn;
bitset<maxn*maxc>available[maxn];



int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int n;
	cin>>n;
	vector<int>a(n);
	int sum=0;
	for(int i=0;i<n;i++) {
		cin>>a[i];
		sum+=a[i];
	}
	for(int i=0;i<=n;i++){
		available[i][0]=true;
		for(int j=0;j<n;j++){
			if(i==j)continue;
			available[i]|=available[i]<<a[j];
		}
	}
	if(sum&1){
		cout<<0;
		return 0;
	}
	vector<int>ans;
	for(int x=0;x<=maxw;x++){
		bool ok=true;
		if(!available[n][sum/2]){
			ok=false;
			break;
		}
		for(int i=0;i<n;i++){
			int nsum=sum-a[i]+x;
			if(nsum&1){
				ok=false;
				break;
			}
			if(!available[i][nsum/2]){
				ok=false;
				break;
			}
		}
		if(ok){
			ans.push_back(x);
		}
	}
	cout<<ans.size()<<endl;
	for(auto x:ans)cout<<x<<" ";
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...