oj.uz

답안 #989992

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
989992 2024-05-29T10:10:17 Z LOLOLO Kpart (eJOI21_kpart) C++17
0 / 100
 55 ms 41044 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
 
#define           f     first
#define           s     second
#define           pb    push_back
#define           ep    emplace
#define           eb    emplace_back
#define           lb    lower_bound
#define           ub    upper_bound
#define       all(x)    x.begin(), x.end()
#define      rall(x)    x.rbegin(), x.rend()
#define   uniquev(v)    sort(all(v)), (v).resize(unique(all(v)) - (v).begin())
#define     mem(f,x)    memset(f , x , sizeof(f))
#define        sz(x)    (ll)(x).size()
#define  __lcm(a, b)    (1ll * ((a) / __gcd((a), (b))) * (b))
#define          mxx    *max_element
#define          mnn    *min_element
#define    cntbit(x)    __builtin_popcountll(x)
#define       len(x)    (int)(x.length())
 
const int N = 1e3 + 10;
int f[N][50000], psum[N];

void solve() {
    int n;
    cin >> n;

    int sum = 0;
    for (int i = 1; i <= n; i++) {
        int x;
        cin >> x;
        sum += x;
        psum[i] = sum;
        for (int j = 1; j <= sum; j++) {
            f[i][j] = f[i - 1][j];
            if (j == x) {
                f[i][j] = i;
            } else if (j > x) {
                f[i][j] = max(f[i][j], f[i - 1][j - x]);
            }
        }
    }

    vector <int> val;
    for (int i = 1; i <= n; i++) {
        int is = 1;
        for (int j = i; j <= n; j++) {
            int sum = psum[j] - psum[j - i];
            if (sum % 2) {
                is = 0;
                break;
            } 

            if (j - f[j][sum / 2] + 1 > i) {
                is = 0;
                break;
            }
        }

        if (is)
            val.pb(i);
    }

    cout << sz(val) << " ";
    for (auto x : val)
        cout << x << " ";

    cout << '\n';
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int t = 1;
    cin >> t;

    while (t--) {
        solve();
    }

    return 0;
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 6492 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 6 ms 14684 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 55 ms 41044 KB Output isn't correct
2 Halted 0 ms 0 KB -