제출 #37479

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
37479		Kerim	Bootfall (IZhO17_bootfall)	C++14	65 / 100	619 ms	2156 KiB

bootfall

#include "bits/stdc++.h"
#define MAXN 100009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x)  cerr<< #x <<" = "<< x<<endl;
using namespace std;

typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
const int N=355;
bitset<N*N>dp;
int arr[N],vis[N];
bool ans[N*N];
int main(){
    //~ freopen("file.in", "r", stdin);
    int n,sum=0;
    scanf("%d",&n);
    dp[0]=1;
    for(int i=1;i<=n;i++){
		scanf("%d",arr+i);
		dp=dp|(dp<<arr[i]);
		sum+=arr[i];
	}
	if(sum&1 or !dp[sum/2]){
		puts("0");
		return 0;
	}	
	for(int j=0;j<=sum;j++)
		ans[j]=1;	
	int total=sum;	
	for(int i=1;i<=n;i++)
		if(!vis[arr[i]]){
			vis[arr[i]]=1;
			dp.reset();dp[0]=1;
			for(int j=1;j<i;j++)
				dp=dp|(dp<<arr[j]);
			for(int j=i+1;j<=n;j++)
				dp=dp|(dp<<arr[j]);	
			total-=arr[i];
			for(int j=0;j<=sum;j++){
				if(!ans[j])
					continue;
				if((j+total)&1){
					ans[j]=0;
					continue;
				}	
				if(!dp[(j+total)/2]){
					ans[j]=0;
					continue;
				}
			}
			total+=arr[i];
		}
	int res=0;
	for(int j=0;j<=sum;j++)
		res+=ans[j];
	printf("%d\n",res);	
	for(int j=0;j<=sum;j++)
		if(ans[j])
			printf("%d ",j);
	puts("");	
	return 0;
}

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

bootfall.cpp: In function 'int main()':
bootfall.cpp:27:19: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
                   ^
bootfall.cpp:30:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",arr+i);
                    ^

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