oj.uz

Submission #233732

# Submission time Handle Problem Language Result Execution time Memory
233732 2020-05-21T14:47:43 Z Haunted_Cpp Bootfall (IZhO17_bootfall) C++17
0 / 100
 16 ms 3456 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 5e2 + 5;
const int S = N * N;

int cur [S];
int nxt [S];

int without [S];

bitset<S> ans;
bitset<S> Get;

int main () {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n;
  cin >> n;
  vector<int> a (n);
  for (int i = 0; i < n; i++) cin >> a[i];
  int whole_sum = accumulate (a.begin(), a.end(), 0);
  cur[0] = nxt[0] = 1;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < S; j++) {
      nxt[j] += cur[j];
      if (j - a[i] >= 0) nxt[j] += cur[j - a[i]];
    }
    for (int j = 0; j < S; j++) {
      cur[j] = nxt[j];
      nxt[j] = 0;
    }
  }
  if ((whole_sum & 1) || (cur[whole_sum / 2] == 0) ) {
    cout << 0 << '\n';
    return 0;
  }
  ans.set();
  for (int i = 0; i < n; i++) {
    whole_sum -= a[i];
    for (int j = 0; j < S; j++) {
      without[j] = cur[j];
    }
    for (int j = a[i]; j < S; j++) {
      if (without[j]) without[j] -= without[j - a[i]];
    }
    Get.reset();
    for (int j = 0; j <= whole_sum; j++) {
      if (without[j]) {     
        int left = j;
        int right = whole_sum - j;
        Get[abs(left - right)] = 1;
      }
    }
    ans &= Get;
    whole_sum += a[i];
  } 
  cout << ans.count() << '\n';
  for (int i = 0; i < S; i++) if (ans[i]) cout << i << ' ';
  return 0;
}

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 3328 KB Output is correct
2 Correct 11 ms 3328 KB Output is correct
3 Correct 7 ms 2304 KB Output is correct
4 Correct 10 ms 3328 KB Output is correct
5 Incorrect 16 ms 3456 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 3328 KB Output is correct
2 Correct 11 ms 3328 KB Output is correct
3 Correct 7 ms 2304 KB Output is correct
4 Correct 10 ms 3328 KB Output is correct
5 Incorrect 16 ms 3456 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 3328 KB Output is correct
2 Correct 11 ms 3328 KB Output is correct
3 Correct 7 ms 2304 KB Output is correct
4 Correct 10 ms 3328 KB Output is correct
5 Incorrect 16 ms 3456 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 3328 KB Output is correct
2 Correct 11 ms 3328 KB Output is correct
3 Correct 7 ms 2304 KB Output is correct
4 Correct 10 ms 3328 KB Output is correct
5 Incorrect 16 ms 3456 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 3328 KB Output is correct
2 Correct 11 ms 3328 KB Output is correct
3 Correct 7 ms 2304 KB Output is correct
4 Correct 10 ms 3328 KB Output is correct
5 Incorrect 16 ms 3456 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 3328 KB Output is correct
2 Correct 11 ms 3328 KB Output is correct
3 Correct 7 ms 2304 KB Output is correct
4 Correct 10 ms 3328 KB Output is correct
5 Incorrect 16 ms 3456 KB Output isn't correct
6 Halted 0 ms 0 KB -