제출 #472777

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
472777		ogibogi2004	Bootfall (IZhO17_bootfall)	C++14	28 / 100	1080 ms	452 KiB

bootfall

#include<bits/stdc++.h>
using namespace std;
const int MAXN=512;
int n,a[MAXN],sum=0;
bitset<MAXN*MAXN>b1,b2,b3;
int main()
{
    cin>>n;
    for(int i=1;i<=n;i++){cin>>a[i];sum+=a[i];}
    for(int i=0;i<MAXN*MAXN;i++)b1[i]=1;
    b2=0;
    b2[0]=1;
    for(int i=1;i<=n;i++)
    {
        for(int j=sum;j>=a[i];j--)
        {
            if(b2[j-a[i]]==1)b2[j]=1;
        }
    }
    b3=0;
    for(int i=0;i<=sum;i++)
    {
        if(b2[i]==0)continue;
        int t1=i,t2=sum-i;
        b3[abs(t1-t2)]=1;
    }
    if(b3[0]==0)
    {
        cout<<"0\n";
        return 0;
    }
    for(int rec=1;rec<=n;rec++)
    {
        sum-=a[rec];
        b2=0;
        b2[0]=1;
        for(int i=1;i<=n;i++)
        {
            if(i==rec)continue;
            for(int j=sum;j>=a[i];j--)
            {
                if(b2[j-a[i]])b2[j]=1;
            }
        }
        b3=0;
        for(int i=0;i<=sum;i++)
        {
            if(b2[i]==0)continue;
            int t1=i,t2=sum-i;
            b3[abs(t1-t2)]=1;
        }
        b1&=b3;
        sum+=a[rec];
        /*for(int i=1;i<MAXN*MAXN;i++)
        {
            if(b3[i]==1)cout<<i<<" ";
        }
        cout<<endl;*/
    }
    vector<int>ans;
    for(int i=1;i<MAXN*MAXN;i++)
    {
        if(b1[i]==1)ans.push_back(i);
    }
    cout<<ans.size()<<endl;
    for(auto xd:ans)
    {
        cout<<xd<<" ";
    }
    cout<<endl;
return 0;
}

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