oj.uz

Submission #602585

# Submission time Handle Problem Language Result Execution time Memory
602585 2022-07-23T09:02:33 Z berr Kpart (eJOI21_kpart) C++17
30 / 100
 2000 ms 784 KB 
#include <bits/stdc++.h>
using namespace std;
vector<int> knp(100005);

int32_t main()
{
    ios_base::sync_with_stdio(false); cin.tie(0);
    int t; cin>>t; 
    int p=0;
    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];
        }
 
 
        knp[0]=0;
 
        count[n]=1;
 
        for(int i=n-1; i>=0; i--)
        {
            count[i]=count[i+1]+1;
 
        }   
 
 
        for(int i=0; i<n; i++)
        {
            if(i>0)
            {
                for(int l=pre[i-1]; l>0; l--)
                {
                    if(knp[l]!=-1)
                    {
                        knp[l+a[i]]=max(knp[l+a[i]], knp[l]);
                    }
                }
            }
            knp[a[i]]=max(knp[a[i]], i+p);
            for(int l=2; l<=i+1; l++)
            {
                int a=pre[i];
                if(i-l>=0) a-=pre[i-l];
                if(a%2==0&&knp[a/2]>=p+i-l+1) count[l]--;
            }

           
 
        }
 
        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
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 596 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 724 KB Output is correct
2 Correct 39 ms 724 KB Output is correct

Subtask #3
0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 181 ms 724 KB Output is correct
2 Correct 525 ms 724 KB Output is correct
3 Correct 569 ms 708 KB Output is correct
4 Correct 1035 ms 724 KB Output is correct
5 Execution timed out 2092 ms 784 KB Time limit exceeded
6 Halted 0 ms 0 KB -