제출 #1309665

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1309665		empyr1n	Kpart (eJOI21_kpart)	C++20	30 / 100	2094 ms	572 KiB

Main

#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>

#define ll long long
#define pb push_back
#define el '\n'

using namespace std;

int main () {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    ll tt; cin >> tt;
    while (tt--) {
        ll n; cin >> n;
        vector <ll> a(n + 1), pr(n + 1);
        pr[0] = 0;
        for (ll i = 1; i <= n; i++) {
            cin >> a[i];
            pr[i] = pr[i - 1] + a[i];
        }

        vector <ll> ans;
        for (ll res = 3; res <= n; res++) {
            bool ok = 1;
            for (ll l = 1; l + res - 1 <= n; l++) {
                ll r = l + res - 1;
                ll sum = pr[r] - pr[l - 1];
                if (sum & 1) {
                    ok = 0;
                    break ;
                }
                sum >>= 1;
                ll mx = 0;
                vector <char> dp(sum + 1, 0);
                dp[0] = 1;
                for (ll i = l; i <= r; i++) {
                    mx = max(mx, a[i]);
                    if (mx > sum) {
                        ok = 0;
                        break ;
                    }
                    for (ll j = sum; j >= a[i]; j--)
                        if (dp[j - a[i]])
                            dp[j] = 1;

                    if (dp[sum])
                        break ;
                }

                if (!ok || !dp[sum]) {
                    ok = 0;
                    break ;
                }
            }

            if (ok)
                ans.pb(res);
        }
        cout << ans.size() << ' ';
        for (ll v : ans)
            cout << v << ' ';
        cout << el;
    }
    return 0;
}

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