oj.uz

Submission #953795

# Submission time Handle Problem Language Result Execution time Memory
953795 2024-03-26T16:43:36 Z nguyennh Bootfall (IZhO17_bootfall) C++14
13 / 100
 1000 ms 452 KB 
#include<bits/stdc++.h>
#define el '\n'
using namespace std ;

int n;

namespace sub_trau{
  // check whether existing a way to divide array into 2 parts with sum = x;
  void solve(){
    vector<int> a(n + 5);
    for ( int i = 1 ; i <= n ; i++ ) cin >> a[i];
    if (n & 1){
      cout << 0;
      return;
    }
    bool odd = false , even = false;
    for ( int i = 1 ; i <= n ; i++ ){
      odd |= (a[i] & 1);
      even |= (a[i] % 2 == 0);
    }
    if (odd && even){
      cout << 0;
      return;
    }
    int sum = accumulate(a.begin() + 1 , a.begin() + n + 1 , 0);
    vector<int> ans , candidates;
    for ( int i = 1 ; i <= n ; i++ ) candidates.push_back(a[i]);
    for ( int val = odd ? 1 : 2 ; val <= sum ; val += 2 ){
      int all = sum + val;
      candidates.push_back(val);
      bool check = true;
      for ( int turn = 0 ; turn < n + 1 ; turn++ ){
        int need = all - candidates[turn];
        if (need & 1){
          check = false;
          break;
        }
        deque<int> cur;
        for ( int j = 0 ; j < candidates.size() ; j++ ){
          if (j == turn) continue;
          cur.push_back(candidates[j]);
        }
        cur.push_front(-1);
        vector<vector<bool>> dp(n + 5 , vector<bool> (need / 2 + 5));
        dp[0][0] = 1;
        for ( int i = 1 ; i <= n ; i++ ){
          for ( int j = 0 ; j <= need / 2 ; j++ ){
            dp[i][j] = dp[i - 1][j];
            if (j >= cur[i] && dp[i - 1][j - cur[i]]){
              dp[i][j] = 1;
            }
          }
        }
        if (!dp[n][need / 2]){
          check = false;
          break;
        }
      }
      if (check) ans.push_back(val);
      candidates.pop_back();
    }
    cout << ans.size() << el;
    for ( auto x : ans ) cout << x << " ";
  }
}

int32_t main (){
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n;
  sub_trau::solve();
}

Compilation message

bootfall.cpp: In function 'void sub_trau::solve()':
bootfall.cpp:39:29: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |         for ( int j = 0 ; j < candidates.size() ; j++ ){
      |                           ~~^~~~~~~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 3 ms 344 KB Output is correct
5 Correct 74 ms 444 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 145 ms 452 KB Output is correct
9 Correct 0 ms 348 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 3 ms 344 KB Output is correct
5 Correct 74 ms 444 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 145 ms 452 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 33 ms 344 KB Output is correct
11 Correct 84 ms 344 KB Output is correct
12 Correct 9 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 92 ms 432 KB Output is correct
15 Correct 55 ms 432 KB Output is correct
16 Correct 81 ms 348 KB Output is correct
17 Correct 16 ms 452 KB Output is correct
18 Correct 49 ms 348 KB Output is correct
19 Correct 37 ms 344 KB Output is correct
20 Correct 35 ms 348 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 3 ms 344 KB Output is correct
5 Correct 74 ms 444 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 145 ms 452 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 33 ms 344 KB Output is correct
11 Correct 84 ms 344 KB Output is correct
12 Correct 9 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 92 ms 432 KB Output is correct
15 Correct 55 ms 432 KB Output is correct
16 Correct 81 ms 348 KB Output is correct
17 Correct 16 ms 452 KB Output is correct
18 Correct 49 ms 348 KB Output is correct
19 Correct 37 ms 344 KB Output is correct
20 Correct 35 ms 348 KB Output is correct
21 Execution timed out 1066 ms 348 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 3 ms 344 KB Output is correct
5 Correct 74 ms 444 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 145 ms 452 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 33 ms 344 KB Output is correct
11 Correct 84 ms 344 KB Output is correct
12 Correct 9 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 92 ms 432 KB Output is correct
15 Correct 55 ms 432 KB Output is correct
16 Correct 81 ms 348 KB Output is correct
17 Correct 16 ms 452 KB Output is correct
18 Correct 49 ms 348 KB Output is correct
19 Correct 37 ms 344 KB Output is correct
20 Correct 35 ms 348 KB Output is correct
21 Execution timed out 1066 ms 348 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 3 ms 344 KB Output is correct
5 Correct 74 ms 444 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 145 ms 452 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 33 ms 344 KB Output is correct
11 Correct 84 ms 344 KB Output is correct
12 Correct 9 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 92 ms 432 KB Output is correct
15 Correct 55 ms 432 KB Output is correct
16 Correct 81 ms 348 KB Output is correct
17 Correct 16 ms 452 KB Output is correct
18 Correct 49 ms 348 KB Output is correct
19 Correct 37 ms 344 KB Output is correct
20 Correct 35 ms 348 KB Output is correct
21 Execution timed out 1066 ms 348 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 3 ms 344 KB Output is correct
5 Correct 74 ms 444 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 145 ms 452 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 33 ms 344 KB Output is correct
11 Correct 84 ms 344 KB Output is correct
12 Correct 9 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 92 ms 432 KB Output is correct
15 Correct 55 ms 432 KB Output is correct
16 Correct 81 ms 348 KB Output is correct
17 Correct 16 ms 452 KB Output is correct
18 Correct 49 ms 348 KB Output is correct
19 Correct 37 ms 344 KB Output is correct
20 Correct 35 ms 348 KB Output is correct
21 Execution timed out 1066 ms 348 KB Time limit exceeded
22 Halted 0 ms 0 KB -