# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
539054 |
2022-03-18T10:38:19 Z |
ddy888 |
Kpart (eJOI21_kpart) |
C++17 |
|
2000 ms |
172304 KB |
#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 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;
int main() {
fast;
cin >> T;
while (T--) {
cin >> N;
vector<int> A(N + 1), ps(N + 1);
for (int i = 1; i <= N; ++i) {
cin >> A[i];
ps[i] = ps[i - 1] + A[i];
}
vector<vector<int> > dp(N + 1, vector<int>(50100));
for (int en = 1; en <= N; ++en) {
dp[en][0] = en;
if (A[en] <= 50000) dp[en][A[en]] = en;
for (int value = 1; value <= 50000; ++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);
vector<int> ans;
for (int k = 1; k <= N; ++k) {
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;}
}
if (can[k]) ans.pb(k);
}
cout << (int)ans.size() << ' ';
for (auto i: ans) cout << i << ' ';
cout << '\n';
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
53 ms |
6516 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
152 ms |
13804 KB |
Output is correct |
2 |
Correct |
304 ms |
23692 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
574 ms |
50916 KB |
Output is correct |
2 |
Correct |
1035 ms |
75880 KB |
Output is correct |
3 |
Correct |
1010 ms |
85712 KB |
Output is correct |
4 |
Correct |
1413 ms |
111416 KB |
Output is correct |
5 |
Execution timed out |
2082 ms |
172304 KB |
Time limit exceeded |
6 |
Halted |
0 ms |
0 KB |
- |