Submission #602756

#	Time	Username	Problem	Language	Result	Execution time	Memory
602756		berr	Kpart (eJOI21_kpart)	C++17	0 / 100	516 ms	788948 KiB

Main

#include <bits/stdc++.h>
using namespace std;
vector<vector<int>> check(1005, vector<int>(100005, 0)), knp(1005, vector<int> (100005, -1));
 
int32_t main()
{
    ios_base::sync_with_stdio(false); cin.tie(0);
    int t; cin>>t; 
    int p=2;
    while(t--)
    {
        int n; cin>>n;
        vector<int> pre(n), a(n), count(n+1);
        for(int i=0; i<n; i++)
        {
            cin>>a[i]; 
            if(i==0) pre[i]=a[i];
            else pre[i]=pre[i-1]+a[i];
        }

        for(int i=0; i<1e5+5; i++)
        {
            knp[0][i]=-1;
        }
      
        knp[0][0]=0;
        knp[0][a[0]]=0;


        for(int i=0; i<n; i++)
        {
            for(int l=2; l<=i+1; l++)
            {
                int a=pre[i];
                if(i-l>=0) a-=pre[i-l];
                if(a%2==0)
                {
                    check[i][a/2]=l+p;
                }
            }
        }

        count[n]=1;
 
        for(int i=n-1; i>=0; i--)
        {
            count[i]=count[i+1]+1;
 
        }   

        for(int i=1; i<n; i++)
        {
            for(int l=0; l<=pre[n-1]/2; l++)
            {
                knp[i][l]=max(knp[i-1][l], knp[i][l]);
                if(knp[i-1][l]>=0)
                {       
                    knp[i][l+a[i]]=max(knp[i][l], knp[i][l+a[i]]);
                    if(check[i][a[i]+l]>p&&knp[i][a[i]+l]>=i-check[i][a[i]+l]+1-p)
                    {
                        count[check[i][a[i]+l]-p]--;
                    }
                }
            }
        }


        vector<int> ans;
        for(int i=2; i<=n; i++)
        {
            if(count[i]==0) ans.push_back(i);
        }
 
        cout<<ans.size()<<" ";
        for(auto i: ans) cout<<i<<" ";
            cout<<"\n";
        p+=n;
    }
   
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 20
• Subtask 3: 0 / 70