oj.uz

답안 #636239

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
636239 2022-08-28T15:13:24 Z Valaki2 Kpart (eJOI21_kpart) C++14
100 / 100
 1286 ms 656 KB 
#include <bits/stdc++.h>
using namespace std;

#pragma GCC optimize ("unroll-loops")

#define sum(l, r) (pref[(r)] - pref[(l) - 1])

const int maxn = 1e3;
const int maxv = 1e5;

int n;
int v[maxn + 1];
int pref[maxn + 1];
short dp[maxv + 1];
bool ans[maxn + 1];
int ans_cnt;

void solve() {
    cin >> n;
    for(short i = 1; i <= n; i++) {
        ans[i] = true;
        cin >> v[i];
        pref[i] = pref[i - 1] + v[i];
    }
    dp[0] = maxn + 1;
    for(int j = 1; j <= maxv; j++) {
        dp[j] = 0;
    }
    int s = -1;
    for(short i = 1; i <= n; i++) {
        for(int j = maxv; j > v[i]; --j) {
            dp[j] = max(dp[j], dp[j - v[i]]);
        }
        dp[v[i]] = i;
        for(short k = 1; k <= i; k++) {
            s = sum(k, i);
            if((s & 1) || (dp[s / 2] < k)) {
                ans[i - k + 1] = false;
            }
        }
    }
    ans_cnt = 0;
    for(short i = 1; i <= n; i++) {
        if(ans[i]) {
            ans_cnt++;
        }
    }
    cout << ans_cnt << " ";
    for(short i = 1; i <= n; i++) {
        if(ans[i]) {
            cout << i << " ";
        }
    }
    cout << "\n";
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int T = 1;
    cin >> T;
    while(T--) {
        solve();
    }
    return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 468 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 77 ms 504 KB Output is correct
2 Correct 144 ms 508 KB Output is correct

Subtask #3
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 284 ms 468 KB Output is correct
2 Correct 497 ms 512 KB Output is correct
3 Correct 506 ms 656 KB Output is correct
4 Correct 691 ms 524 KB Output is correct
5 Correct 1052 ms 540 KB Output is correct
6 Correct 1286 ms 588 KB Output is correct
7 Correct 1182 ms 588 KB Output is correct