Submission #172947

#	Time	Username	Problem	Language	Result	Execution time	Memory
172947		LinusTorvaldsFan	Bootfall (IZhO17_bootfall)	C++14	65 / 100	1070 ms	15736 KiB

bootfall

#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
 
using namespace std;
 
const int maxn=501;
const int maxc=501;
const int maxw=maxc*maxn;
bitset<maxn*maxc>available[maxn];
bitset<maxn*maxc>used[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++){
		if(i>0) {
			available[i]=available[i-1];
			available[i]|=available[i]<<a[i-1];
		}
		else available[i][0]=true;
	}
	for(int i=0;i<=n;i++){
		for(int j=i+1;j<n;j++){
			available[i]|=available[i]<<a[j];
		}
	}
	if(sum&1){
		cout<<0;
		return 0;
	}
	if(!available[n][sum>>1]){
		cout<<0;
		return 0;
	}
	
	for(int i=0;i<n;i++){
		if(((sum-a[i]) & 1) != ((sum-a[0])&1)){
			cout<<0;
			return 0;
		}
	}
	
	vector<int>ans;
	for(int x=(sum-a[0])&1;x<=maxw;x+=2){
		bool ok=true;	
		for(int i=0;i<n;i++){
			int nsum=sum-a[i]+x;
			if(!available[i][nsum>>1]){
				ok=false;
				break;
			}
		}
		if(ok){
			ans.push_back(x);
		}
	}
	cout<<ans.size()<<"\n";
	for(auto& x:ans)cout<<x<<" ";
	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