# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
91237 | Vardanyan | Bootfall (IZhO17_bootfall) | C++14 | 977 ms | 245172 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
const int N = 505;
bool dp[N][N*N*2];
int a[N];
int dp1[N*N*2];
int main()
{
int n;
scanf("%d",&n);
int MX = 0;
int sum = 0;
for(int i = 1;i<=n;i++){
scanf("%d",&a[i]);
MX+=a[i];
sum+=a[i];
}
sort(a+1,a+1+n);
dp1[0] = 1;
for(int j = 1;j<=n;j++){
for(int s = 2*MX;s>=0;s--){
if(dp1[s]) dp1[s+a[j]] += dp1[s];
}
}
for(int i = 1;i<=n;i++){
for(int s = 0;s<=2*MX;s++) dp1[s+a[i]] -= dp1[s];
for(int s = 0;s<=2*MX;s++) dp[i][s] = dp1[s];
for(int s = 2*MX;s>=0;s--) dp1[s+a[i]] += dp1[s];
}
if(!dp1[sum/2]){
printf("0\n");
return 0;
}
vector<int> ans;
for(int x = 1;x<=MX;x++){
sum+=x;
bool F = true;
for(int i = 1;i<=n;i++){
sum-=a[i];
int need = sum/2;
sum+=a[i];
if(need-x<0){
F = false;
break;
}
if(dp[i][need-x] && (sum-a[i])%2 == 0) continue;
F = false;
break;
}
sum-=x;
if(F) ans.push_back(x);
}
printf("%d\n",ans.size());
for(int i = 0;i<ans.size();i++) printf("%d ",ans[i]);
printf("\n");
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |