oj.uz

Submission #539061

# Submission time Handle Problem Language Result Execution time Memory
539061 2022-03-18T10:45:04 Z ddy888 Kpart (eJOI21_kpart) C++17
30 / 100
 2000 ms 172156 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 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> cannot(N + 1);
        int ans = 0;
        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) {cannot[k] = 1; break;}
                else if (dp[i + k - 1][sum / 2] < i) {cannot[k] = 1; break;}
            }
            if (!cannot[k]) ++ans;
        }
        cout << ans << ' ';
        for (int i = 1; i <= N; ++i) if (!cannot[i]) cout << i << ' ';
        cout << '\n';
    }
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 6516 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 188 ms 13864 KB Output is correct
2 Correct 325 ms 23748 KB Output is correct

Subtask #3
0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 586 ms 51012 KB Output is correct
2 Correct 1031 ms 75932 KB Output is correct
3 Correct 1178 ms 85572 KB Output is correct
4 Correct 1472 ms 111476 KB Output is correct
5 Execution timed out 2045 ms 172156 KB Time limit exceeded
6 Halted 0 ms 0 KB -