This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int main(){
int t, n, sum, op;
cin >> t;
vector<int> a;
vector<int> lasti;
vector<bool> k;
while (t--){
cin >> n;
a.resize(n);
lasti.assign(50001, -1);
k.assign(n+1, true);
k[0] = false;
for (int i=0; i<n; i++){
cin >> 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;
}
sum = 0;
for (int j=i; j>=0; j--){
sum += a[j];
if (sum % 2 || lasti[sum / 2] < j){
k[i - j + 1] = false;
}
}
}
op = 0;
for (int x : k){
if (x){
op++;
}
}
cout << op << " ";
for (int i=1; i<n+1; i++){
if (k[i]){
cout << i << " ";
}
}
cout << "\n";
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |