Submission #978853

#TimeUsernameProblemLanguageResultExecution timeMemory
978853VMaksimoski008Kpart (eJOI21_kpart)C++17
30 / 100
2032 ms484 KiB
#include <bits/stdc++.h> #define sz(x) (int)x.size() #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() //#define int long long using namespace std; using ll = long long; using ull = unsigned long long; using ld = long double; using pii = pair<int, int>; using pll = pair<ll, ll>; const int mod = 1e9 + 7; const int LOG = 20; const int maxn = 1e5 + 5; const double eps = 1e-9; void solve() { int n; cin >> n; vector<int> v(n+1); for(int i=1; i<=n; i++) cin >> v[i]; vector<bool> ans(n+1, 1); for(int i=1; i<=n; i++) { bitset<100001> bs; bs[0] = 1; ll sum = 0; for(int j=i; j<=n; j++) { sum += v[j]; bs |= (bs << v[j]); if(sum % 2 == 1 || !ans[j-i+1]) { ans[j-i+1] = 0; continue; } if(!bs[sum/2]) ans[j-i+1] = 0; } } vector<int> res; for(int i=1; i<=n; i++) if(ans[i]) res.push_back(i); cout << res.size() << " "; for(int &x : res) cout << x << " "; cout << '\n'; } int32_t main() { int t = 1; cin >> t; while(t--) solve(); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...