Submission #522881

#	Time	Username	Problem	Language	Result	Execution time	Memory
522881		Nursik	Bootfall (IZhO17_bootfall)	C++14	0 / 100	3 ms	2252 KiB

bootfall

#include <bits/stdc++.h>

#define pb push_back
#define ll long long
#define ld long double
#define f first
#define s second
#define mp make_pair

const ll maxn = 5e2 + 1, maxm = 4e3 + 1,  maxk = 61;
const ll inf = 1000000000, mod = inf + 7, mod2 = 998244353;
const ll pa = 31, block = 400;

using namespace std;

int n, x, y;
int a[maxn], dp[maxn * maxn], cnt[maxn * maxn], cnt2[maxn * maxn];
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    cin >> n;
    dp[0] = 1;
    for (int i = 1; i <= n; ++i){
        cin >> a[i];
        for (int j = x; j >= 0; --j){
            if (dp[j] > 0 && j + a[i] <= x){
                dp[j + a[i]] += dp[j];
            }
        }
        x += a[i];
    }
    if (x % 2 != 0 || (x % 2 == 0 && dp[x / 2] == 0)){
        cout << 0 << '\n';
        return 0;
    }
    for (int i = 1; i <= maxn * maxn - 1; ++i){
        cnt[i] = 1;
    }
    for (int i = 1; i <= n; ++i){
        y = x - a[i];
        for (int j = 0; j <= maxn * maxn - 1; ++j){
            if (j + a[i] <= x){
                dp[j + a[i]] -= dp[j];
            }
        }
        for (int j = 0; j <= maxn * maxn - 1; ++j){
            if (dp[j] > 0){
                ll f = j, s = y - j;
                ll rz = abs(f - s);
                if (cnt[rz] == 1){
                    cnt2[rz] = 1;
                }
            }
        }
        for (int j = x; j >= 0; --j){
            if (j + a[i] <= x){
                dp[j + a[i]] += dp[j];
            }
        }
        for (int j = 1; j <= maxn * maxn - 1; ++j){
            cnt[j] = cnt2[j];
            cnt2[j] = 0;
        }
    }
    vector<int> v;
    for (int i = 1; i <= maxn * maxn - 1; ++i){
        if (cnt[i] > 0){
            v.pb(i);
        }
    }
    cout << v.size() << '\n';
    for (auto it : v){
        cout << it << " ";
    }
}

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