oj.uz

Submission #1062965

# Submission time Handle Problem Language Result Execution time Memory
1062965 2024-08-17T12:40:46 Z armashka Kpart (eJOI21_kpart) C++17
100 / 100
 607 ms 1372 KB 
#include<bits/stdc++.h>

#pragma GCC target("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

using namespace std;

#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file(s) freopen(s".in", "r", stdin);freopen(s".out", "w", stdout);
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ft first
#define sd second
#define ll long long
#define ull unsigned ll
#define pii pair<int,int>
#define pll pair<ll,ll>
const int N = 1e6 + 10;
const int M = 1e6 + 5;
const int B = 316;
const ll msize = 2;
const ll mod1 = 1e9 + 7;
const ll mod2 = 998244353;
const long double Phi = acos(-1);
const long long inf = 2e9;
const vector <pair<int, int>> dir = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};

ll binmul(ll x, ll ti, ll m);
ll binpow(ll x, ll ti, ll m);

int n, a[1005], pref[1005];
bool ok[1005];

const void solve() {
    cin >> n;
    for (int i = 1; i <= n; ++ i) cin >> a[i], pref[i] = pref[i - 1] + a[i], ok[i] = 1;
    int S = pref[n];

    vector <ll> dp(S / 2 + 2, 0), new_dp(S / 2 + 2, 0);
    dp[0] = 1;
    for (int i = 1; i <= n; ++ i) {
        for (int j = 0; j <= (S / 2 + 1) - a[i]; ++ j) {
            new_dp[j + a[i]] = max(new_dp[j + a[i]], dp[j]);
        }
        new_dp[a[i]] = i;

        dp = new_dp;
        for (int len = 1; len <= i; ++ len) {
            int sum = pref[i] - pref[i - len];
            if (sum % 2 == 1 || dp[sum / 2] <= i - len) ok[len] = 0;
        }
    }

    vector <int> ans;
    for (int i = 2; i <= n; ++ i) {
        if (ok[i]) ans.pb(i);
    }

    cout << ans.size() << " ";
    for (auto x : ans) cout << x << " ";
    cout << '\n';
}

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

    // file("promote");

    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);

    int tt = 1;
    cin >> tt;
    for (int i = 1; i <= tt; ++ i) {
        // cout << "Caso #" << i << "\n";
        // n = i;
        solve();
    }

    #ifndef ONLINE_JUDGE
    cerr << "\n" << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
    #endif

    return 0;
}


// Template functions
ll binmul(ll x, ll ti, ll m) { ll res = 0;while (ti){if(ti & 1)res += x;x += x;ti >>= 1; x %= m; res %= m;} return res;}
ll binpow(ll x, ll ti, ll m) { ll res = 1;while (ti){if(ti & 1)(res *= x)%=m;(x*=x)%=m;ti >>= 1; x %= m; res %= m;} return res;}

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 528 KB Output is correct
2 Correct 6 ms 604 KB Output is correct

Subtask #3
70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 604 KB Output is correct
2 Correct 84 ms 780 KB Output is correct
3 Correct 75 ms 884 KB Output is correct
4 Correct 150 ms 932 KB Output is correct
5 Correct 354 ms 1140 KB Output is correct
6 Correct 535 ms 1288 KB Output is correct
7 Correct 607 ms 1372 KB Output is correct