제출 #92297

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
92297		Nordway	Bootfall (IZhO17_bootfall)	C++14	100 / 100	385 ms	3932 KiB

bootfall

#include <bits/stdc++.h>
#define x first
#define y second
#define pb push_back
#define mp make_pair
#define up_b upper_bound
#define low_b lower_bound
#define sz(x) (int)x.size()
#define all(v) v.begin(),v.end()
#define boost ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<int,ll> pil;
typedef pair<ll,int> pli;
typedef pair<ll,ll> pll;

const int inf = INT_MAX;
const int mod = 998244353;
const int dx[4] = {0, 0, 1, -1};
const int dy[4] = {1, -1, 0, 0};
const int N = 505;
const int M = 1e2+1;

int a[N],p[N*N],sum,b[N*N],cnt[N*N];

void add(int x){
	for(int i=sum;i>=0;i--){
		if(i>=x)p[i]+=p[i-x];
	}
}

void del(int x){
	for(int i=0;i<=sum;i++)b[i]=p[i];
	for(int i=0;i<=sum;i++){
		if(i>=x)b[i]-=b[i-x];
	}
}

int main(){
	boost;
	int n;
	cin>>n;
	p[0]=1;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		sum+=a[i];
		add(a[i]);
	}
	if(sum%2||p[sum/2]==0){
		cout<<0;
		return 0;
	}
	for(int i=1;i<=n;i++){
		del(a[i]);
		for(int j=sum;j>=0;j--){
			if(b[j]){
				int val=sum-2*j-a[i];
				//cout<<val<<" ";
				if(val>0)cnt[val]++;
			}
		}
	}
	int ans=0;
	for(int i=0;i<=sum;i++){
		if(cnt[i]==n)ans++;
	}
	cout<<ans<<endl;
	for(int i=0;i<=sum;i++){
		if(cnt[i]==n)cout<<i<<" ";
	}
	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