제출 #1084215

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1084215		elotelo966	Bootfall (IZhO17_bootfall)	C++17	100 / 100	359 ms	5840 KiB

bootfall

#include <bits/stdc++.h>
using namespace std;
 
#define int long long
#define OYY LLONG_MAX
#define mod 998244353
#define faster ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define FOR for(int i=1;i<=n;i++)
#define mid (start+end)/2
#define lim 250005
#define fi first
#define se second

int dp[lim];

int cev[lim];

int sum;

int32_t main(){
	faster
	int n;cin>>n;
	int dizi[n];
	FOR{
		cin>>dizi[i];
		sum+=dizi[i];
	}
	
	dp[0]=1;
	
	FOR{
		for(int j=sum;j>=dizi[i];j--){
			dp[j]+=dp[j-dizi[i]];
		}
	}
	
	if(sum&1 || dp[sum/2]==0){
		cout<<0<<'\n';
		return 0;
	}
	
	FOR{
		for(int j=dizi[i];j<=sum;j++){
			dp[j]-=dp[j-dizi[i]];
		}
		for(int j=1;j<=sum;j++){
			int cur_sum=sum-dizi[i]+j;
			if(cur_sum%2==0 && dp[cur_sum/2])cev[j]++;
		}
		for(int j=sum;j>=dizi[i];j--){
			dp[j]+=dp[j-dizi[i]];
		}
	}
	
	vector<int> cevv;
	
	for(int i=1;i<=sum;i++){
		if(cev[i]==n)cevv.push_back(i);
	}
	
	cout<<cevv.size()<<'\n';
	
	for(auto x:cevv){
		cout<<x<<" ";
	}
	
	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