Submission #1029924

#	Time	Username	Problem	Language	Result	Execution time	Memory
1029924		andrewp	Bootfall (IZhO17_bootfall)	C++14	13 / 100	37 ms	3672 KiB

bootfall

#include <bits/stdc++.h>

using namespace std;

#define ll int64_t
#define ar array
#define dbg(x) cerr << #x << ": " << x << "\n";

const int mxN=5e2+3;

int n, a[mxN], dp[mxN*mxN][2];

int main() {
    ios::sync_with_stdio(0);
	cin.tie(0);

    cin >> n;
    int sum=0;
    for(int i=1; i<=n; ++i) {
        cin >> a[i];
        sum+=a[i];
    }
    dp[0][0]=1;
    for(int i=1; i<=n; ++i) {
        for(int s=mxN*mxN-1; s>=a[i]; --s) {
            dp[s][0]+=dp[s-a[i]][0];
        }
    }
    if(sum%2==1) {
        cout << 0 << "\n";
        return 0;
    }
    if(dp[sum/2][0]==0) {
        cout << 0 << "\n";
        return 0;
    }
    vector<int> brM(mxN*mxN, 0);
    for(int i=1; i<=n; ++i) {
        for(int s=0; s<mxN*mxN; ++s) {
            dp[s][1]=dp[s][0];
        }
        for(int s=0; s<mxN*mxN-a[i]; ++s) {
            dp[s+a[i]][1]-=dp[s][1];
        }
        for(int s=0; s<mxN*mxN; ++s) {
            int get=s+sum-a[i];
            if(get%2==0&&get/2>=s&&dp[get/2-s][1]>0) {
                ++brM[s];
            }
        }
    }
    vector<int> ans;
    for(int s=0; s<mxN*mxN; ++s) {
        if(brM[s]==n) ans.push_back(s);
    }
    cout << ans.size() << "\n";
    for(int x:ans) cout << x << " ";
    cout << "\n";
    return 0;
}

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