oj.uz

Submission #631759

# Submission time Handle Problem Language Result Execution time Memory
631759 2022-08-18T16:49:11 Z ZsofiaKeresztely Kpart (eJOI21_kpart) C++14
100 / 100
 717 ms 508 KB 
#include <bits/stdc++.h>
using namespace std;
 
int main(){
  int t, n, s, sum, op;
  cin >> t;
  while (t--){
    cin >> n;
    int a[n + 1];
    bool k[n + 1];
    s = a[0] = k[0] = 0;
    for (int i=1; i<n+1; i++){
      cin >> a[i];
      s += a[i];
      k[i] = true;
    }
    s /= 2;
    int lasti[s + 1] = {};
    for (int i=1; i<n+1; i++){
      for (int j=s-a[i]; j>0; j--){
        lasti[j + a[i]] = max(lasti[j + a[i]], lasti[j]);
      }
      if (a[i] <= s){
        lasti[a[i]] = i;
      }
      sum = 0;
      for (int j=i; j>0; j--){
        sum += a[j];
        if (sum % 2 || lasti[sum / 2] < j){
          k[i - j + 1] = false;
        }
      }
    }
    op = 0;
    for (int x : k){
      if (x){
        op++;
      }
    }
    cout << op << " ";
    for (int i=1; i<n+1; i++){
      if (k[i]){
        cout << i << " ";
      }
    }
    cout << "\n";
  }
  return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 212 KB Output is correct
2 Correct 10 ms 212 KB Output is correct

Subtask #3
70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 340 KB Output is correct
2 Correct 115 ms 372 KB Output is correct
3 Correct 127 ms 468 KB Output is correct
4 Correct 234 ms 408 KB Output is correct
5 Correct 501 ms 464 KB Output is correct
6 Correct 717 ms 508 KB Output is correct
7 Correct 658 ms 480 KB Output is correct