Submission #724340

#	Time	Username	Problem	Language	Result	Execution time	Memory
724340		Denkata	Bootfall (IZhO17_bootfall)	C++14	65 / 100	1092 ms	712 KiB

bootfall

#include<bits/stdc++.h>
#define endl '\n'
#pragma GCC optimize("Ofast")
using namespace std;
const int maxn = 503;
bitset <250006> ans;
bitset <250006> tek;
bitset <250006> newtek;
int i,j,p,q,n,m,k,sum;
int a[maxn];
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    cin>>n;
    for(i=1; i<=n; i++)
    {
        cin>>a[i];
        sum+=a[i];
    }
    if(sum%2!=0)
    {
        cout<<0<<endl;
        return 0;
    }
    for(i=2;i<=n;i++)
    {
        if(a[i]%2!=a[i-1]%2)
        {
            cout<<0<<endl;
            return 0;
        }
    }
    bitset <250006> tek;
    tek.set(0);
    tek[0]=true;
    for(i=1;i<=n;i++)
    {
        tek|=(tek<<a[i]);
    }
    if(!tek[sum/2])
    {
        cout<<0<<endl;
        return 0;
    }
    for(i=1;i<sum;i++)
        ans[i]=1;
    tek.set(false);
    for(i=1;i<=n;i++)
    {
        ///bez i
        bitset <250006> tek;
        tek[0]=1;
        for(j=1;j<=n;j++)
        {
            if(j==i)continue;
            tek|=(tek<<(2*a[j]));
        }

        tek=(tek<<(a[i]));
        tek[0]=1;

        ans&=tek;

    }
    int br = 0;
    for(i=1;i<sum;i++)
        if(ans[i])br++;
    cout<<br<<endl;
    for(i=sum-1;i>=1;i--)
    {
        if(ans[i])
            cout<<sum-i<<" ";
    }
    return 0;
}
/**
4
1 3 1 5

4
200 200 200 200
*/

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