oj.uz

답안 #1044000

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1044000 2024-08-05T06:16:52 Z juicy Kpart (eJOI21_kpart) C++17
100 / 100
 1149 ms 924 KB 
#include <bits/stdc++.h>

using namespace std;

#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif

const int N = 1e3 + 5, A = 1e5 + 5;

int n;
int dp[A], pf[N];
bool res[N];

int main() {
  ios::sync_with_stdio(false); cin.tie(nullptr);

  int t; cin >> t;
  while (t--) {
    cin >> n;
    fill(res + 2, res + n + 1, 1);
    memset(dp, -1, sizeof(dp));
    for (int i = 1; i <= n; ++i) {
      int x; cin >> x;
      pf[i] = pf[i - 1] + x;
      for (int j = A - 1; j >= x; --j) {
        dp[j] = max(dp[j], dp[j - x]);
      }
      dp[x] = i;
      for (int j = 2; j <= i; ++j) {
        int x = pf[i] - pf[i - j];
        res[j] &= x % 2 == 0 && dp[x / 2] > i - j;
      }
    }
    vector<int> ans;
    for (int i = 2; i <= n; ++i) {
      if (res[i]) {
        ans.push_back(i);
      }
    }
    cout << ans.size() << " ";
    for (int x : ans) {
      cout << x << " ";
    }
    cout << "\n";
  }
  return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 68 ms 852 KB Output is correct
2 Correct 122 ms 856 KB Output is correct

Subtask #3
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 236 ms 836 KB Output is correct
2 Correct 421 ms 856 KB Output is correct
3 Correct 436 ms 856 KB Output is correct
4 Correct 589 ms 856 KB Output is correct
5 Correct 869 ms 924 KB Output is correct
6 Correct 1149 ms 920 KB Output is correct
7 Correct 1055 ms 860 KB Output is correct