#undef _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define int long long
#define pb push_back
#define fi first
#define si second
#define ar array
typedef pair<int,int> pi;
typedef tuple<int,int,int> ti;
void debug_out() {cerr<<endl;}
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {cerr<<" "<<to_string(H);debug_out(T...);}
#define debug(...) cerr<<"["<<#__VA_ARGS__<<"]:",debug_out(__VA_ARGS__)
int T;
int N;
signed main() {
fast;
cin >> T;
while (T--) {
cin >> N;
vector<int> A(N + 1), ps(N + 1);
int lim = 0;
for (int i = 1; i <= N; ++i) {
cin >> A[i];
ps[i] = ps[i - 1] + A[i];
lim += A[i];
}
vector<vector<int> > dp(N + 1, vector<int>(lim + 1));
for (int en = 1; en <= N; ++en) {
dp[en][0] = en;
if (A[en] <= lim / 2 + 1) dp[en][A[en]] = en;
for (int value = 1; value <= lim / 2 + 1; ++value) {
if (value >= A[en]) dp[en][value] = max(dp[en - 1][value - A[en]], dp[en - 1][value]);
else dp[en][value] = dp[en - 1][value];
}
}
vector<int> can(N + 1, 1);
for (int k = 1; k <= N; ++k) { // candidate lengths
for (int i = 1; i <= N - k + 1; ++i) {
int sum = ps[i + k - 1] - ps[i - 1];
if (sum % 2 != 0) {can[k] = 0; break;}
else if (dp[i + k - 1][sum / 2] < i) {can[k] = 0; break;}
}
}
vector<int> ans;
for (int i = 1; i <= N; ++i) {
if (can[i]) ans.pb(i);
}
cout << (int)ans.size() << ' ';
for (auto i: ans) cout << i << ' ';
cout << '\n';
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
1020 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
19 ms |
4312 KB |
Output is correct |
2 |
Correct |
82 ms |
12876 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
350 ms |
52344 KB |
Output is correct |
2 |
Correct |
923 ms |
119136 KB |
Output is correct |
3 |
Correct |
1102 ms |
151316 KB |
Output is correct |
4 |
Correct |
1890 ms |
258680 KB |
Output is correct |
5 |
Execution timed out |
2092 ms |
606296 KB |
Time limit exceeded |
6 |
Halted |
0 ms |
0 KB |
- |