# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1089330 | vjudge1 | Kpart (eJOI21_kpart) | C++17 | 2069 ms | 162876 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
/**
* data : 09.07.2024
*
**/
#include <bits/stdc++.h>
// #include "algo/turnikmen.h"
using namespace std;
#define int long long
#define bitt __builtin_popcountll
#define bitzero __builtin_clz
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
void fReopen () {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
signed main (/* time : 9:17 AM */) {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
fReopen();
int t; cin >> t;
while (t --> 0) {
int n; cin >> n;
vector<int> a(n); for (auto &x : a) cin >> x;
vector<int> pref(n + 1);
vector<int> ans;
for (int i = 0; i < n; i++) pref[i + 1] = pref[i] + a[i];
for (int len = 2; len <= n; len++) {
int ok = 1;
const int N = 1e5 + 3;
vector<int> st(N, -1);
vector<int> d;
int mx = -2e9;
for (int i = 0; i + len <= n; i++) {
int sum = pref[i + len] - pref[i];
mx = max(mx, sum);
if (sum % 2 == 1) {
ok = 0;
break;
}
if (st[sum] == -1)
st[sum] = i;
d.push_back(sum);
}
if (!ok) continue;
// cout << len << " ";
for (auto s : d) {
// cout << s << ' ';
bitset<40> dp;
// dp.reset();
dp[0] = 1;
for (int i = st[s]; i < st[s] + len; i++) {
if (a[i] > s / 2) continue;
// dp[i] = 1;
dp |= (dp << a[i]);
}
// cout << dp << '\n';
ok &= (dp[s / 2] == 1);
}
// cout << endl;
if (ok) ans.push_back(len);
}
cout << ans.size() << endl;
for (auto to : ans) cout << to << ' ';
cout << endl;
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |