제출 #889321

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
889321		Nelt	Kpart (eJOI21_kpart)	C++17	30 / 100	2048 ms	592 KiB

Main

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,fma")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

/* DEFINES */
#define S second
#define F first
#define ll long long
#define ull unsigned long long
#define ld long double
#define npos ULLONG_MAX
#define INF LLONG_MAX
#define vv(a) vector<a>
#define pp(a, b) pair<a, b>
#define pq(a) priority_queue<a>
#define qq(a) queue<a>
#define ss(a) set<a>
#define mm(a, b) map<a, b>
#define ump(a, b) unordered_map<a, b>
#define ANDROID                   \
    ios_base::sync_with_stdio(0); \
    cin.tie(0);                   \
    cout.tie(0);
#define elif else if
#define endl "\n"
#define allc(a) begin(a), end(a)
#define all(a) a, a + sizeof(a) / sizeof(a[0])
#define pb push_back
#define logi(a) __lg(a)
#define sqrt(a) sqrtl(a)
#define mpr make_pair
#define ins insert
using namespace std;
using namespace __gnu_pbds;
using namespace __cxx11;
typedef char chr;
typedef basic_string<chr> str;
template <typename T, typename key = less<T>>
using ordered_set = tree<T, null_type, key, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const ll MAX = 1e5 + 5, N = 1005;
bitset<MAX> bs;
ll a[N];
bool can[N];
void solve()
{
    ll n, sum = 0;
    cin >> n;
    for (ll i = 1; i <= n; i++)
        cin >> a[i], can[i] = true, sum += a[i];
    for (ll i = 1; i <= n; i++)
    {
        bs = 1;
        for (ll j = i, sum = 0; j <= n; j++)
        {
            bs |= bs << a[j];
            sum += a[j];
            if ((sum & 1) or !bs.test(sum >> 1))
                can[j - i + 1] = false;
        }
    }
    vv(ll) ans;
    for (ll i = 1; i <= n; i++)
        if (can[i])
            ans.pb(i);
    cout << ans.size() << " ";
    for (ll i : ans)
        cout << i << " ";
    cout << endl;
}
/*

*/
int main()
{
    ANDROID
    // precomp();
    ll t = 1;
    cin >> t;
    for (ll i = 1; i <= t; i++)
        // cout << "Case #" << i << ": ",
        solve();
    cerr << "\nTime elapsed : " << clock() * 1000.0 / CLOCKS_PER_SEC << " ms\n";
}

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