제출 #1189309

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1189309		vnedu	Kpart (eJOI21_kpart)	C++17	10 / 100	11 ms	324 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 sub1
{
    bool check()
    {
        bool ok=1;
        for(int i=1;i<=numTest;++i) ok&=(test[i].n<=30);
        return ok;
    }
    const int M = 1e5 + 10;
    bitset<M> b;
    bool ok[100][100];
    int n,a[100];
    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';
        }
    }
}
void solve()
{
    cin>>numTest;
    for(int i=1;i<=numTest;++i) test[i].input();
    if(sub1::check()) return void(sub1::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: 0 / 20
• Subtask 3: 0 / 70