Submission #535410

#	Time	Username	Problem	Language	Result	Execution time	Memory
535410		i_am_noob	Bootfall (IZhO17_bootfall)	C++17	65 / 100	1081 ms	12708 KiB

bootfall

#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast,unroll-loops")

#define ll long long
#define int ll
#define ull unsigned ll
#define ld long double
#define rep(a) rep1(i,a)
#define rep1(i,a) rep2(i,0,a)
#define rep2(i,b,a) for(int i=(b); i<((int)(a)); i++)
#define rep3(i,b,a) for(int i=(b); i>=((int)(a)); i--)
#define chkmin(a,b) (a=min(a,b))
#define chkmax(a,b) (a=max(a,b))
#define all(a) a.begin(),a.end()
#define pii pair<int,int>
#define pb push_back
//#define inf 1010000000
#define inf 4000000000000000000
#define eps 1e-9
#define sz(a) ((int)a.size())
#define pow2(x) (1ll<<(x))
#define ceiling(a,b) (((a)+(b)-1)/(b))
#define print0(a) cout << (a) << ' '
#define ykh mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
#ifdef i_am_noob
#define bug(...) cerr << "#" << __LINE__ << ' ' << #__VA_ARGS__ << "- ", _do(__VA_ARGS__)
template<typename T> void _do(T && x) {cerr << x << endl;}
template<typename T, typename ...S> void _do(T && x, S&&...y) {cerr << x << ", "; _do(y...);}
#else
#define bug(...) 777771449
#endif

const int mod=1000000007;
const int maxn=505,maxm=18,maxk=7777714;

//i_am_noob
int n,a[maxn],sum;
bitset<maxn*maxn> bs[maxn];

void orzck(){
    cin >> n;
    rep(n) cin >> a[i];
    sum=accumulate(a,a+n,0ll);
    bitset<maxn*maxn> b;
    b[0]=1;
    rep(n) b|=b<<a[i];
    if((sum&1)||!b[sum/2]){
        cout << "0\n";
        return;
    }
    rep(n) if((a[0]+a[i])&1){
        cout << "0\n";
        return;
    }
    rep(n){
        bs[i][0]=1;
        rep1(j,n) if(i!=j) bs[i]|=bs[i]<<a[j];
        bs[i]<<=a[i]/2;
    }
    b.set();
    rep(n) b&=bs[i];
    vector<int> res;
    rep2(i,1,sum+1) if((i+a[0])%2==0){
        if(b[(sum+i)/2]) res.pb(i);
    }
    cout << sz(res) << "\n";
    for(auto i: res) cout << i << ' ';
    cout << "\n";
}

signed main(){
    ios_base::sync_with_stdio(0),cin.tie(0);
    orzck();
    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