Submission #50291

#	Time	Username	Problem	Language	Result	Execution time	Memory
50291		mra2322001	Bootfall (IZhO17_bootfall)	C++14	0 / 100	2 ms	376 KiB

bootfall

#include <bits/stdc++.h>
#define f0(i, n) for(int i=(0); i<n; i++)
#define f1(i, n) for(int i=(1); i<=n; i++)

using namespace std;
typedef long long ll;
const int N = 502;

int n, a[N], f[N*N], sum = 0, dd[N*N];

void add(int x){
    for(int i = sum; i >= 0; i--){
        f[i] += f[i - x];
    }
}

void del(int x){
    for(int i = 0; i <= sum; i++){
        if(i >= x)
            f[i] -= f[i - x];
    }
}

int main(){
    ios_base::sync_with_stdio(0);

    cin >> n;
    f[0] = 1;
    f1(i, n){
        cin >> a[i], sum += a[i];
        add(a[i]);
    }
    if(sum%2 || f[sum/2]==0){
        return cout << 0, 0;
    }
    f1(i, n){
        del(a[i]);
        for(int j = sum; j >= 0; j--){
            if(f[j] != 0){
                int x = sum - 2*j - a[i];
                if(x > 0) dd[x]++;
            }
        }
        add(a[i]);
    }
    int cnt = 0;
    for(int j = 0; j <= sum; j++) if(dd[j]==n) ++cnt;
    cout << cnt << endl;
    for(int j = 0; j <= sum; j++) if(dd[j]==n) cout << j << " ";
}

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