#include "bits/stdc++.h"
using namespace std;
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define tr(i, c) for(auto i = c.begin(); i != c.end(); ++i)
#define wr puts("----------------")
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
const int N = 1003;
const int S = 1e5+5;
int v[N], par[N];
bool ok[N];
int odp[S], dp[S];
void solve(int green_flecks){
int n;
scanf("%d", &n);
for(int i = 1; i <= n; ++i){
int x;
scanf("%d", &x);
v[i] = x, ok[i] = 1, par[i] = par[i-1]+x;
}
int ss = accumulate(v+1, v+n+1, 0);
for(int i = 1; i <= n; i++){
for(int j = 0; j <= ss; ++j)
odp[j] = dp[j];
for(int j = v[i]; j <= ss; ++j)
umax(odp[j], dp[j-v[i]]);
odp[v[i]] = i;
for(int j = 0; j <= ss; ++j)
dp[j] = odp[j];
for(int j = i-1; j >= 1; j--){
int sm = par[i]-par[j-1], k = i-j+1;
if(sm&1 or dp[sm/2]<j)
ok[k] = 0;
}
}
vector<int> A;
for(int i = 2; i <= n; ++i)
if(ok[i])
A.pb(i);
printf("%d", (int)A.size());
tr(it, A)
printf(" %d", *it);
puts("");
}
int main(){
int tt;
scanf("%d", &tt);
while(tt--)
solve(tt);
return 0;
}
Compilation message
Main.cpp: In function 'void solve(int)':
Main.cpp:23:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
23 | scanf("%d", &n);
| ~~~~~^~~~~~~~~~
Main.cpp:26:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
26 | scanf("%d", &x);
| ~~~~~^~~~~~~~~~
Main.cpp: In function 'int main()':
Main.cpp:56:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
56 | scanf("%d", &tt);
| ~~~~~^~~~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
7 ms |
504 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
87 ms |
604 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |