Submission #1022420

#	Time	Username	Problem	Language	Result	Execution time	Memory
1022420		phoenix	Bootfall (IZhO17_bootfall)	C++17	65 / 100	90 ms	2004 KiB

bootfall

#include <bits/stdc++.h>
 
using namespace std;
 
const int MOD1 = 1e9 + 7;
const int MOD2 = 1e9 + 9;
const int MOD3 = 998244353;
const int MOD4 = 999990011;
const int MOD5 = 999994081;
 
template<unsigned int MOD> 
struct mint {
    unsigned int v;
    mint() {}
    mint(long long val) : v(val - (val >= MOD) * MOD + (val < 0) * MOD) {}
    mint<MOD>& operator += (mint<MOD> other) {
        *this = mint(v + other.v);
        return *this;
    }
    mint<MOD>& operator -= (mint<MOD> other) {
        *this = mint(v - other.v);
        return *this;
    }
};
const int N = 370;
const int A = 123000;
 
int lim = 0;
mint<MOD1> dp1[A]{1};
mint<MOD2> dp2[A]{1};
mint<MOD3> dp3[A]{1};
mint<MOD4> dp4[A]{1};
mint<MOD5> dp5[A]{1};

unsigned int dp[A]{1};

int sum = 0;
 
void add(int val) {
    sum += val;
    for (int i = lim; i >= val; i--) {
        dp[i] += dp[i - val];
        // dp1[i] += dp1[i - val];
        // dp2[i] += dp2[i - val];
        // dp3[i] += dp3[i - val];
        // dp4[i] += dp4[i - val];
        // dp5[i] += dp5[i - val];
    }   
}
 
bool check(int sum) {
    if (sum < 0 && sum > lim) return 0;
    return (dp[sum]);
    // bool flag = true;
    // flag &= (dp1[sum].v > 0);
    // flag &= (dp2[sum].v > 0);
    // flag &= (dp3[sum].v > 0);
    // flag &= (dp4[sum].v > 0);
    // flag &= (dp5[sum].v > 0);
    // return flag;
}
 
void del(int val) {
    sum -= val;
    for (int i = val; i <= lim; i++) {
        dp[i] -= dp[i - val];
        // dp1[i] -= dp1[i - val];
        // dp2[i] -= dp2[i - val];
        // dp3[i] -= dp3[i - val];
        // dp4[i] -= dp4[i - val];
        // dp5[i] -= dp5[i - val];
    }
}
 
int n;
int a[N];
 
int cnt[A];
 
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        lim += a[i];
    }
    for (int i = 0; i < n; i++) {
        add(a[i]);
    }
    if (sum & 1 || !check(sum / 2)) {
        cout << 0;
        return 0;
    }
 
    for (int i = 0; i < n; i++) {
        if (i) add(a[i - 1]);
        del(a[i]);
        for (int s = 0; s <= lim; s++) {
            if (check(s)) {
                cnt[abs(2 * s - sum)]++;
            }
        }
    }
    vector<int> res;
    for (int i = 1; i <= lim; i++) {
        if (cnt[i] == 2 * n) 
            res.push_back(i);
    }
    cout << (int)res.size() << '\n';
    for (int c : res) cout << c << ' ';
}

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