oj.uz

Submission #537532

# Submission time Handle Problem Language Result Execution time Memory
537532 2022-03-15T07:48:29 Z siewjh Kpart (eJOI21_kpart) C++17
30 / 100
 2000 ms 171808 KB 
#include <bits/stdc++.h>
using namespace std;
inline void read(int& x) {
    x = 0;
    char ch = getchar_unlocked();
    while (ch < '0' || ch > '9') ch = getchar_unlocked();
    while (ch >= '0' && ch <= '9') {
        x = (x << 3) + (x << 1) + (ch & 15);
        ch = getchar_unlocked();
    }
}
int main(){
    int cases; read(cases);
    while (cases--){
        int nums; read(nums);
        vector<int> vec(nums + 1), pref(nums + 1);
        pref[0] = 0;
        for (int i = 1; i <= nums; i++) read(vec[i]);
        for (int i = 1; i <= nums; i++) pref[i] = pref[i - 1] + vec[i];
        vector<vector<int>> dp(nums + 1, vector<int>(50005, -1));
        vector<bool> ok(nums + 1, 1);
        for (int i = 1; i <= nums; i++){
            for (int sum = 0; sum < vec[i]; sum++) dp[i][sum] = dp[i - 1][sum];
            for (int sum = vec[i]; sum < 50005; sum++) dp[i][sum] = max(dp[i - 1][sum], dp[i - 1][sum - vec[i]]);
            dp[i][vec[i]] = i;
            for (int j = 1; j <= i; j++){
                int sum = pref[i] - pref[j - 1], sz = i - j + 1;
                if (ok[sz]){
                    if (sum % 2) ok[sz] = 0;
                    else if (dp[i][sum / 2] < j) ok[sz] = 0;
                }
            }
        }
        int cnt = 0;
        for (int i = 1; i <= nums; i++)
            if (ok[i])
                cnt++;
        cout << cnt << ' ';
        for (int i = 1; i <= nums; i++)
            if (ok[i])
                cout << i << ' ';
        cout << '\n';
    }
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 149 ms 13840 KB Output is correct
2 Correct 324 ms 23700 KB Output is correct

Subtask #3
0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 596 ms 50932 KB Output is correct
2 Correct 1088 ms 75624 KB Output is correct
3 Correct 1095 ms 85564 KB Output is correct
4 Correct 1478 ms 111100 KB Output is correct
5 Execution timed out 2102 ms 171808 KB Time limit exceeded
6 Halted 0 ms 0 KB -