Submission #1043997

#TimeUsernameProblemLanguageResultExecution timeMemory
1043997juicyKpart (eJOI21_kpart)C++17
0 / 100
234 ms860 KiB
#include <bits/stdc++.h> using namespace std; #ifdef LOCAL #include "debug.h" #else #define debug(...) 42 #endif const int N = 1e3 + 5, A = 1e5 + 5; int n; int dp[A], pf[N]; bool res[N]; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int t; cin >> t; while (t--) { cin >> n; fill(res + 2, res + n + 1, 1); memset(dp, -1, sizeof(dp)); for (int i = 1; i <= n; ++i) { int x; cin >> x; pf[i] = pf[i - 1] + x; dp[x] = i; for (int j = A - 1; j >= x; --j) { dp[j] = max(dp[j], dp[j - x]); } for (int j = 2; j <= i; ++j) { int x = pf[i] - pf[i - j]; res[j] &= x % 2 == 0 && dp[x / 2] > i - j; } } vector<int> ans; for (int i = 2; i <= n; ++i) { if (res[i]) { ans.push_back(i); } } cout << ans.size() << " "; for (int x : ans) { cout << x << " "; } cout << "\n"; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...