oj.uz

Submission #602648

# Submission time Handle Problem Language Result Execution time Memory
602648 2022-07-23T09:48:46 Z berr Kpart (eJOI21_kpart) C++17
30 / 100
 2000 ms 25888 KB 
#include <bits/stdc++.h>
using namespace std;
 
int32_t main()
{
    ios_base::sync_with_stdio(false); cin.tie(0);
    int t; cin>>t; 
    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];
        }
 
        vector<vector<int>> check(n, vector<int>(pre[n-1]+5, 0));
        vector<int> knp(pre[n-1]+5, -1);
 
        knp[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;
                }
            }
        }
        count[n]=1;
 
        for(int i=n-1; i>=0; i--)
        {
            count[i]=count[i+1]+1;
 
        }   
 
 
        vector<int> q;
        vector<int> vis(100005);

        for(int i=0; i<n; i++)
        {
            int z=q.size();
            for(int l=0; l<z; l++)
            {

                if(vis[q[l]+a[i]]==0)
                {
                    q.push_back(q[l]+a[i]);
                    vis[q[l]+a[i]]=1;
                }

                knp[a[i]+q[l]]=max(knp[a[i]+q[l]], knp[q[l]]);

                if(check[i][q[l]+a[i]]&&knp[a[i]+q[l]]>=i-check[i][q[l]+a[i]]+1)
                {

                    count[check[i][q[l]+a[i]]]--;
                } 


            }
            
            knp[a[i]]=i;
            if(check[i][a[i]])
            {
                count[check[i][a[i]]]--;
            }
            if(vis[a[i]]==0)
            {
                vis[a[i]]=1;
                q.push_back(a[i]);
            }



         /*   int z=q.size();
            for(int l=0; l<z; l++)
            {
                knp[q[l]+a[i]]=max(knp[q[l]]+a[i], knp[q[l]]);
                if(vis[q[l]+a[i]]==0)
                {
                    vis[q[l]+a[i]]=1;
                    q.push_back(q[l]+a[i]);
                }
            }
            knp[a[i]]=i;
            if(vis[a[i]]==0)
            {
                vis[a[i]]=1;
                q.push_back(a[i]);

            }
           */
    sort(q.begin(), q.end(), greater<int>());
        }

        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";
 
    }
   
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 1100 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 144 ms 2696 KB Output is correct
2 Correct 709 ms 6968 KB Output is correct

Subtask #3
0 / 70.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2053 ms 25888 KB Time limit exceeded
2 Halted 0 ms 0 KB -