Submission #38464

#	Time	Username	Problem	Language	Result	Execution time	Memory
38464		MrPlany	Bootfall (IZhO17_bootfall)	C++14	100 / 100	599 ms	5804 KiB

bootfall

#include<bits/stdc++.h>
using namespace std;
const int maxn = 505;
const int mx = 250000;
int n;
int a[maxn], cnt[mx+505];
int dp[mx+505], temp[mx+505];
vector<int> ans;
int main() {
    scanf("%d",&n);
    for(int i=1;i<=n;i++) scanf("%d",&a[i]);
    int sum = 0;
    for(int i=1;i<=n;i++) sum += a[i];
    dp[0] = 1;
    for(int i=1;i<=n;i++) {
        for(int x=mx;x>=0;x--) dp[x+a[i]] += dp[x];
//        for(int x=0;x<=mx;x++) printf("%lld ",dp[x]);
//        printf("\n");
    }
    if(sum%2!=0 || dp[sum/2]==0) return !printf("0");
    for(int i=1;i<=n;i++) {
        memset(temp,0,sizeof(temp));
        for(int x=0;x<=mx;x++) {
            temp[x] += dp[x];
            temp[x+a[i]] -= temp[x];
        }
//        printf("%d : ",i);
        for(int x=0;x<=mx;x++) {
//            printf("%d ",temp[x]);
            if((sum-a[i]+x)%2==0 && sum-a[i]-x>=0 && temp[(sum-a[i]-x)/2]!=0) cnt[x]++;
        }
//        printf("\n");
    }
    for(int i=1;i<=mx;i++) if(cnt[i]==n) ans.push_back(i);
    printf("%d\n",ans.size());
    for(auto x : ans) printf("%d ",x);
}

Compilation message (stderr)

bootfall.cpp: In function 'int main()':
bootfall.cpp:35:29: warning: format '%d' expects argument of type 'int', but argument 2 has type 'std::vector<int>::size_type {aka long unsigned int}' [-Wformat=]
     printf("%d\n",ans.size());
                             ^
bootfall.cpp:10:19: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
                   ^
bootfall.cpp:11:44: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i=1;i<=n;i++) scanf("%d",&a[i]);
                                            ^

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