Submission #682113

#	Time	Username	Problem	Language	Result	Execution time	Memory
682113		opPO	Bootfall (IZhO17_bootfall)	C++17	65 / 100	1080 ms	1740 KiB

bootfall

#pragma GCC optimize("O3,unroll-loops")
#include <bits/stdc++.h>

using namespace std;

//#define int long long
#define f first
#define s second
#define pb push_back
#define ld long double
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define vec vector

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());
const ld eps = 1e-6;
const int mod = 998244353;
const int oo = 2e9;
const ll OO = 2e18;
const int N = 250001;
int n;
bitset<N> can;

void backpack(vec<int> &a)
{
    can.reset();
    can[0] = 1;
    for (int i = 1; i <= n; i++) can |= can << a[i];
}

void solve()
{
    cin >> n;
    vec<int> a(n + 1);
    int s = 0;
    for (int i = 1; i <= n; i++) cin >> a[i], s += a[i];
    backpack(a);
    if (!can[s / 2])
    {
        cout << 0;
        return;
    }
    vec<int> cnt(500 * n + 1);
    for (int i = 1; i <= n; i++)
    {
        int t = a[i];
        a[i] = 0;
        backpack(a);
        a[i] = t;
        int from = (s - a[i]) % 2 ? 1 : 2;
        for (int j = from; j <= 500 * n; j += 2)
        {
            if (can[(s - a[i] + j) / 2]) cnt[j]++;
        }
    }
    vec<int> ans;
    for (int i = 1; i <= 500 * n; i++) if (cnt[i] == n) ans.pb(i);
    cout << sz(ans) << "\n";
    for (int &x : ans) cout << x << " ";
}

int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    solve();
    return 0;
}

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