제출 #1159101

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1159101		PieArmy	Bootfall (IZhO17_bootfall)	C++20	100 / 100	288 ms	3520 KiB

bootfall

typedef long long ll;
ll pie(ll army){return (1ll<<army);}
#include <bits/stdc++.h>
#define fr first
#define sc second
#define pb push_back
#define endl '\n'
#define mid ((left+right)>>1)
const ll inf=2000000000000000005;
const int sonsuz=2000000005;
using namespace std;
ll fpow(ll x,ll y,ll m=0){if(y<0){cout<<"powError";return -1;}if(m)x%=m;ll res=1;while(y>0){if(y&1)res*=x;x*=x;if(m){x%=m;res%=m;}y>>=1;}return res;}

int n;
int dp[250001],arr[500];
int sum=0;
int ans[250001];

void code(){
	cin>>n;
	dp[0]=1;
	for(int i=0;i<n;i++){
		cin>>arr[i];
		sum+=arr[i];
		for(int j=500*n-arr[i];j>=0;j--){
			dp[j+arr[i]]+=dp[j];
		}
	}
	if((sum&1)||dp[sum>>1]==0){
		cout<<0;
		return;
	}
	for(int i=0;i<n;i++){
		for(int j=0;j+arr[i]<=500*n;j++){
			dp[j+arr[i]]-=dp[j];
		}
		sum-=arr[i];
		for(int j=1;j<=500*n;j++){
			if((j&1)!=(arr[i]&1))continue;
			if(j>sum)break;
			sum+=j;
			if(j*2<=sum&&dp[(sum/2)-j]){
				ans[j]++;
			}
			sum-=j;
		}
		sum+=arr[i];
		for(int j=500*n-arr[i];j>=0;j--){
			dp[j+arr[i]]+=dp[j];
		}
	}
	vector<int>v;
	for(int i=1;i<=500*n;i++){
		if(ans[i]==n)v.pb(i);
	}
	cout<<v.size()<<endl;
	for(int x:v){
		cout<<x<<" ";
	}
}

int main(){
	ios_base::sync_with_stdio(false);cin.tie(NULL);
	bool usaco=0;if(usaco){freopen(".in","r",stdin);freopen(".out","w",stdout);}
	int t=1;
	if(!t)cin>>t;
	while(t--){code();cout<<endl;}
	return 0;
}

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

bootfall.cpp: In function 'int main()':
bootfall.cpp:64:39: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   64 |         bool usaco=0;if(usaco){freopen(".in","r",stdin);freopen(".out","w",stdout);}
      |                                ~~~~~~~^~~~~~~~~~~~~~~~~
bootfall.cpp:64:64: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   64 |         bool usaco=0;if(usaco){freopen(".in","r",stdin);freopen(".out","w",stdout);}
      |                                                         ~~~~~~~^~~~~~~~~~~~~~~~~~~

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