Submission #878203

#	Time	Username	Problem	Language	Result	Execution time	Memory
878203		alexdd	Bootfall (IZhO17_bootfall)	C++17	28 / 100	1032 ms	19288 KiB

bootfall

#include<bits/stdc++.h>
using namespace std;
int n,tot;
int a[505];
bitset<500005> dp[505];
int variante[500005],cntv;
int newv[500005],cntnew;
signed main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
        tot+=a[i];
    }
    for(int i=1;i<=tot;i++)
        variante[++cntv]=i;
    dp[0][250000]=1;
    for(int i=0;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
        {
            if(i==j)
                dp[j] = dp[j-1];
            else
                dp[j] = ((dp[j-1]<<a[j])|(dp[j-1]>>a[j]));
        }
        if(i==0)
        {
            if(dp[n][250000]==0)
            {
                cntv=0;
                break;
            }
            continue;
        }
        cntnew=0;
        for(int j=1;j<=cntv;j++)
        {
            int x = variante[j];
            if(dp[n][x+250000] || dp[n][-x+250000])
                newv[++cntnew] = x;
            ///difs = -x
            ///difs = x
        }
        cntv=cntnew;
        for(int j=1;j<=cntnew;j++)
            variante[j] = newv[j];
    }
    cout<<cntv<<"\n";
    for(int i=1;i<=cntv;i++)
        cout<<variante[i]<<" ";
    return 0;
}
/**
3
2 2 2
*/

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