# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
1062964 |
2024-08-17T12:38:40 Z |
armashka |
Kpart (eJOI21_kpart) |
C++17 |
|
2000 ms |
2084 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);
ll 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;
vector <ll> dp(100001, 0), new_dp(100001, 0);
dp[0] = 1;
for (int i = 1; i <= n; ++ i) {
for (int j = 0; j <= 100000 - 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 <ll> 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;}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
47 ms |
1884 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
143 ms |
2008 KB |
Output is correct |
2 |
Correct |
262 ms |
2036 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
456 ms |
2020 KB |
Output is correct |
2 |
Correct |
898 ms |
2036 KB |
Output is correct |
3 |
Correct |
870 ms |
2048 KB |
Output is correct |
4 |
Correct |
1266 ms |
2068 KB |
Output is correct |
5 |
Execution timed out |
2013 ms |
2084 KB |
Time limit exceeded |
6 |
Halted |
0 ms |
0 KB |
- |