Submission #631026

#TimeUsernameProblemLanguageResultExecution timeMemory
631026ZsofiaKeresztelyKpart (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; cin >> t; vector<int> a, lasti, pref; set<int> k; while (t--){ cin >> n; a.resize(n); lasti.assign(50001, -1); pref = {0}; k.clear(); for (int i=0; i<n; i++){ cin >> a[i]; k.insert(i + 1); pref.push_back(pref[i] + a[i]); for (int j=50000-a[i]; j>0; j--){ lasti[j + a[i]] = max(lasti[j + a[i]], lasti[j]); } if (a[i] <= 50000){ lasti[a[i]] = i; } for (auto it=k.begin(); it!=k.end(); it++){ if ((pref[i + 1] - pref[i - *it + 1]) % 2 || lasti[(pref[i + 1] - pref[i - *it + 1]) / 2] < i - *it + 1){ k.erase(it); } } cerr << "\n"; } 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...