Submission #1189754

#	Time	Username	Problem	Language	Result	Execution time	Memory
1189754		vnedu	Kpart (eJOI21_kpart)	C++17	100 / 100	745 ms	1948 KiB

Main

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

template<class T> bool maximize(T &a, const T &b){ return (a < b ? a = b, 1 : 0); }
template<class T> bool minimize(T &a, const T &b){ return (a > b ? a = b, 1 : 0); }

#define fi first
#define se second

#define pb push_back
#define ii pair<int, int>

#define all(x) x.begin(), x.end()

#define TASK "nonsense"

/// end of template ///

const int T = 21;
const int N = 1e3 + 10;
int numTest;
struct Testcase
{
    int n,a[N];
    Testcase() {}
    void input()
    {
        cin>>n;
        for(int i=1;i<=n;++i) cin>>a[i];
    }
} test[T];
namespace sub12
{
    bool check()
    {
        bool ok=1;
        for(int i=1;i<=numTest;++i) ok&=(test[i].n<=120);
        return ok;
    }
    const int M = (1e5+10)/2;
    bitset<M> b;
    bool ok[N][N];
    int n,a[N];
    void solve()
    {
        for(int tri=1;tri<=numTest;++tri)
        {
            n=test[tri].n;
            for(int i=1;i<=n;++i) a[i]=test[tri].a[i];
            for(int i=1;i<=n;++i)
            {
                b.reset();
                b[0]=1;
                int curSum=0;
                for(int j=i;j<=n;++j)
                {
                    curSum+=a[j];
                    b|=(b<<a[j]);
                    ok[i][j]=(!(curSum&1)&&(b[curSum>>1]));
                }
            }
            vector<int> v;
            for(int k=1;k<=n;++k)
            {
                bool ans=1;
                for(int i=1;i+k-1<=n;++i) ans&=ok[i][i+k-1];
                if(ans) v.pb(k);
            }
            cout<<(int)v.size()<<' ';
            for(int x : v) cout<<x<<' ';
            cout<<'\n';
        }
    }
}
namespace subfull
{
    const int M = 5e4 + 5;
    int dp[M],p[N],n,a[N];
    bool ok[N][N];
    void work()
    {
        for(int i=1;i<=n;++i) p[i]=p[i-1]+a[i];
        memset(dp,-1,sizeof(dp));
        memset(ok,0,sizeof(ok));
        for(int i=1;i<=n;++i)
        {
            dp[0]=i;
            for(int j=p[i];j>=a[i];--j) maximize(dp[j],dp[j-a[i]]);
            int r=i;
            for(int l=1;l<=i;++l)
            {
                int sum=p[r]-p[l-1];
                if(!(sum&1) && dp[sum>>1]>=l) ok[l][r]=1;
            }
        }
//        for(int i=1;i<=n;++i) for(int j=i;j<=n;++j) cout<<i<<' '<<j<<' '<<ok[i][j]<<'\n';
        int cnt=0;
        for(int k=1;k<=n;++k)
        {
            bool is=1;
            for(int i=1;i+k-1<=n;++i) is&=ok[i][i+k-1];
//            cout<<k<<' '<<is<<'\n';
            cnt+=is;
        }
        cout<<cnt<<' ';
        for(int k=1;k<=n;++k)
        {
            bool is=1;
            for(int i=1;i+k-1<=n;++i) is&=ok[i][i+k-1];
            if(is) cout<<k<<' ';
        }
        cout<<'\n';
    }
    void solve()
    {
        for(int tri=1;tri<=numTest;++tri)
        {
            n=test[tri].n;
            for(int i=1;i<=n;++i) a[i]=test[tri].a[i];
            work();
        }
    }
}
void solve()
{
    cin>>numTest;
    for(int i=1;i<=numTest;++i) test[i].input();
    if(sub12::check()) return void(sub12::solve());
    return void(subfull::solve());
}

int main()  {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

//    freopen(TASK".inp","r",stdin);
//    freopen(TASK".out","w",stdout);

    int testcase=1;
//    cin>>testcase;

    while (testcase--)
        solve();

    return 0;
}

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