oj.uz

Submission #602826

# Submission time Handle Problem Language Result Execution time Memory
602826 2022-07-23T11:39:57 Z berr Kpart (eJOI21_kpart) C++17
30 / 100
 2000 ms 342760 KB 
#include <bits/stdc++.h>
using namespace std;
int check[1005][100015];
 
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];
        }
 
        vector<int> knp(pre[n-1]+5, -1);
        

        knp[0]=0;
        for(int i=0; i<n; i++)
        {
            for(int l=0; l<=1e5; l++)
                check[i][l]=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=0; i<n; i++)
        {
            set<int> s;
            for(int l=pre[n-1]-a[i]+1; l>0; l--)
            {
                if(knp[l]!=-1)
                {
                    knp[l+a[i]]=max(knp[l+a[i]], knp[l]);
 
                    if(check[i][l+a[i]]>p&&knp[l+a[i]]>=i-check[i][l+a[i]]-p+1)
                    {
                        count[check[i][l+a[i]]-p]--;
                    }
                }
            }
            knp[a[i]]=max(knp[a[i]], i);
            if(check[i][a[i]]>p&&knp[a[i]]>=i-check[i][a[i]]-p+1)
            {
                count[check[i][a[i]]-p]--;
            }
           
 
            for(auto j: s) count[j]--;
        }
 
        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=0;
    }
   
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 11988 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 26460 KB Output is correct
2 Correct 164 ms 46212 KB Output is correct

Subtask #3
0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 461 ms 100696 KB Output is correct
2 Correct 1067 ms 150436 KB Output is correct
3 Correct 1174 ms 170032 KB Output is correct
4 Correct 1989 ms 221372 KB Output is correct
5 Execution timed out 2100 ms 342760 KB Time limit exceeded
6 Halted 0 ms 0 KB -