Submission #36155

#TimeUsernameProblemLanguageResultExecution timeMemory
36155Dat160601Bootfall (IZhO17_bootfall)C++14
13 / 100
0 ms5108 KiB
#include <bits/stdc++.h> using namespace std; #define pb push_back vector <int> ans; int n,a[507],sum[507],dp[250007],save[250007],res[250007]; int main(){ ios_base::sync_with_stdio(0); cin>>n; for(int i=1;i<=n;i++){ cin>>a[i]; sum[i]=sum[i-1]+a[i]; } if(sum[n]%2==1){ cout<<0; return 0; } save[0]=1; save[a[1]]=1; for(int i=2;i<=n;i++){ for(int j=0;j<=sum[i];j++){ if(j<a[i]) dp[j]=save[j]; else dp[j]=save[j]+save[j-a[i]]; } for(int j=0;j<=sum[i];j++) save[j]=dp[j]; } if(dp[sum[n]/2]==0){ cout<<0; return 0; } for(int i=1;i<=n;i++){ for(int j=0;j<=sum[n];j++) save[j]=dp[j]; for(int j=0;j<=sum[n];j++){ if(j>=a[i]) save[j]-=save[j-a[i]]; } for(int j=sum[n];j>=1;j--){ int val=sum[n]+j-a[i]; if(val%2==1 || save[val/2]==0) continue; res[j]++; } } for(int j=1;j<=sum[n];j++){ if(res[j]==n) ans.pb(j); } cout<<(int)ans.size()<<"\n"; for(int i=0;i<(int)ans.size();i++) cout<<ans[i]<<" "; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...