제출 #93075

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
93075		emil_physmath	Bootfall (IZhO17_bootfall)	C++17	28 / 100	1068 ms	27520 KiB

bootfall

#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <vector>
using namespace std;
const int MAXN=275;

int a[MAXN];
bool isNotAns[501*501];

vector<int> NotPossSums(int arr[], int n);
int main()
{
	int n, sum=0;
	cin>>n;
	for (int i=0; i<n; i++)
	{
		cin>>a[i];
		sum+=a[i];
	}
	vector<int> temp=NotPossSums(a, n);
	auto it=lower_bound(temp.begin(), temp.end(), sum/2);
	if (sum%2 || (it!=temp.end() && *it==sum/2)) {
		cout<<"0\n";
		return 0;
	}
	for (int j=0; j<n; j++)
	{
		swap(a[j], a[n-1]);
		vector<int> temp=NotPossSums(a, n-1);
		swap(a[j], a[n-1]);
		for (int x=1; x<=sum; x++)
			if ((sum-a[j]+x)%2 || (sum-a[j]+x)/2-x<0)
				isNotAns[x]=true;
		for (int i=0; i<temp.size(); i++)
		{
			int cur=temp[i];
			if (sum-a[j]-2*cur>0) isNotAns[sum-a[j]-2*cur]=true;
		}
	}
	vector<int> ans;
	for (int x=1; x<=sum; x++)
		if (!isNotAns[x])
			ans.push_back(x);
	cout<<ans.size()<<'\n';
	for (int i=0; i<ans.size(); i++)
		cout<<ans[i]<<' ';
	cout<<'\n';

	char I;
	cin >> I;
	return 0;
}

bool dp[MAXN][100000];
vector<int> NotPossSums(int arr[], int n)
{
	int sum=0;
	for (int i=0; i<n; i++)
		sum+=arr[i];
	memset(dp, 0, sizeof(dp));
	for (int i=0; i<=n; i++)
		dp[i][0]=true;
	for (int i=1; i<=n; i++)
	{
		dp[i][arr[i-1]]=true;
		for (int j=1; j<=sum; j++)
		{
			if (dp[i-1][j]==true)
			{
				dp[i][j]=true;
				dp[i][j+arr[i-1]]=true;
			}
		}
	}
	vector<int> res;
	for (int j=0; j<=sum; j++)
		if (!dp[n][j])
			res.push_back(j);
	return res;
}

컴파일 시 표준 에러 (stderr) 메시지

bootfall.cpp: In function 'int main()':
bootfall.cpp:38:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i=0; i<temp.size(); i++)
                 ~^~~~~~~~~~~~
bootfall.cpp:49:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i=0; i<ans.size(); i++)
                ~^~~~~~~~~~~

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