Submission #631063

#TimeUsernameProblemLanguageResultExecution timeMemory
631063ZsofiaKeresztelyKpart (eJOI21_kpart)C++14
0 / 100
1 ms852 KiB
#include <bits/stdc++.h> using namespace std; int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); int t, n, s; cin >> t; vector<int> a, lasti, pref; set<int> k; while (t--){ cin >> n; a.assign(n+1, 0); lasti.assign(50001, -1); pref.assign(n+1, 0); k.clear(); s = 0; for (int i=1; i<n+1; i++){ cin >> a[i]; s += a[i]; pref[i] = s; } s /= 2; for (int i=1; i<n+1; i++){ k.insert(i); for (int j=s-a[i]; j>0; j--){ lasti[j + a[i]] = max(lasti[j + a[i]], lasti[j]); } if (a[i] <= s){ lasti[a[i]] = i; } auto it = k.begin(); while (it != k.end()){ if ((pref[i] - pref[i - *it]) % 2 || lasti[(pref[i] - pref[i - *it]) / 2] < i - *it + 1){ k.erase(it); if (!k.empty()){ it++; } } it++; } } cout << k.size() << " "; for (int x : k){ cout << x << " "; } cout << "\n"; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...