Submission #522896

#	Time	Username	Problem	Language	Result	Execution time	Memory
522896		Nursik	Bootfall (IZhO17_bootfall)	C++14	100 / 100	641 ms	4828 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 = 3e5 + 1,  maxk = 61;
const ll inf = 1000000000, mod = inf + 7, mod2 = 998244353;
const ll pa = 31, block = 400;

using namespace std;

int n, sum;
int a[maxn], dp[maxm], cnt[maxm], ans[maxm];
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 = maxm - 1; j >= a[i]; j--)
            dp[j] += dp[j - a[i]];
        sum += a[i];
    }
    if (sum % 2 != 0 || dp[sum / 2] == 0){
        cout << 0;
        return 0;
    }
    for (int i = 1; i <= n; ++i){
        for (int j = a[i]; j <= maxm - 1; ++j){
            dp[j] -= dp[j - a[i]];
        }
        for (int j = 0; j <= maxm - 1; ++j){
            if (dp[j]){
                int f = j, s = sum - a[i] - j;
                int rz = abs(f - s);
                cnt[rz] = 1;
            }
        }
        for (int j = 0; j <= maxm - 1; ++j){
            if (cnt[j] > 0){
                ans[j]++;
            }
            cnt[j] = 0;
        }
        for (int j = maxm - 1; j >= a[i]; --j){
            dp[j] += dp[j - a[i]];
        }
    }
    vector<int> v;
    for (int i = 1; i <= maxm - 1; ++i){
        if (ans[i] == n){
            v.pb(i);
        }
    }
    cout << v.size() << '\n';
    for (auto it : v){
        cout << it << " ";
    }
}

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