제출 #630125

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
630125		kideso	Kpart (eJOI21_kpart)	C++17	30 / 100	2093 ms	627516 KiB

Main

#include <iostream>
#include <queue>
#include <algorithm>

//#include <fstream>

using namespace std;

//ifstream F("be.txt");

vector<int> ans, x, s;
vector<vector<int> > dp;
int N;
const int maxN = 1e5;

int main(){
    int T;
    cin >> T;

    while(T--){
        ans.clear();

        cin >> N;
        x.assign(N + 1, 0);
        s.assign(N + 1, 0);

        for(int i = 1; i <= N; ++i){
            cin >> x[i];
            s[i] = s[i - 1] + x[i];
        }

        dp.assign(N + 1, vector<int> (s[N] + 1, 0));

        for(int i = 1; i <= N; ++i){
            for(int j = s[N]; j >= x[i]; --j)
                dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - x[i]]);
            
            dp[i][x[i]] = i;
            
            for(int j = x[i] - 1; j >= 0; --j)
                dp[i][j] = dp[i - 1][j];
        }

        bool ok;

        for(int i = 2; i <= N; ++i){
            ok = true;

            for(int j = 1; j <= N - i + 1; ++j){
                int sum = s[j + i - 1] - s[j - 1];
                if(sum % 2 || dp[j + i - 1][sum / 2] < j) ok = false;
            }

            if(ok) ans.push_back(i);
        }

        cout << ans.size() << ' ';
        for(auto e:ans)
            cout << e << ' ';
        cout << '\n';
    }

    return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 20 / 20
• Subtask 3: 0 / 70