oj.uz

Submission #954330

# Submission time Handle Problem Language Result Execution time Memory
954330 2024-03-27T15:47:44 Z nguyennh Bootfall (IZhO17_bootfall) C++14
65 / 100
 288 ms 6040 KB 
#include<bits/stdc++.h>
#define el '\n'
using namespace std ;

const int MN = 2e5 + 50;

int n;

namespace sub_trau{
  int64_t dp[MN];
  
  // 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);
    int mn = *min_element(a.begin() + 1 , a.begin() + n + 1); 
    dp[0] = 1;
    for ( int i = 1 ; i <= n ; i++ ){
      for ( int j = sum ; j >= a[i] ; j-- ) dp[j] += dp[j - a[i]];
    }
    if (!dp[sum / 2] || (sum & 1)){
      cout << 0;
      return;
    }
    vector<int> ans , candidates;
    for ( int i = 1 ; i <= n ; i++ ) candidates.push_back(a[i]);
    for ( int val = odd ? 1 : 2 ; val <= sum - mn ; val += 2 ){
      int all = sum + val;
      candidates.push_back(val);
      for ( int j = all ; j >= val ; j-- ) dp[j] += dp[j - val];
      bool check = true;
      for ( int turn = 0 ; turn < n ; turn++ ){
        if (!check) break;
        int need = all - candidates[turn];
        if (need & 1){
          check = false;
          break;  
        }
        for ( int j = candidates[turn] ; j <= need / 2 ; j++ ){
          dp[j] -= dp[j - candidates[turn]];
        }
        if (!dp[need / 2]){
          check = false;
        }
        for ( int j = need / 2 ; j >= candidates[turn] ; j-- ) dp[j] += dp[j - candidates[turn]];
      }
      if (check) ans.push_back(val);
      candidates.pop_back();
      for ( int j = val ; j <= all ; j++ ) dp[j] -= dp[j - val];
    }
    cout << ans.size() << el;
    for ( auto x : ans ) cout << x << " ";
  }
}

namespace sub_final{
  __int128 dp[MN];
  bool choose[MN];
  
  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);
    dp[0] = 1;
    for ( int i = 1 ; i <= n ; i++ ){
      for ( int j = sum ; j >= a[i] ; j-- ) dp[j] += dp[j - a[i]];
    }
    if (!dp[sum / 2] || (sum & 1)){
      cout << 0;
      return;
    }
    memset(choose , true , sizeof(choose));
    for ( int i = odd ? 2 : 1 ; i <= MN ; i += 2 ) choose[i] = false;
    for ( int i = 1 ; i <= n ; i++ ){
      vector<int64_t> ndp(MN + 5);
      for ( int j = 0 ; j <= MN ; j++ ) ndp[j] = dp[j];
      for ( int j = a[i] ; j <= MN ; j++ ) ndp[j] -= ndp[j - a[i]];
      for ( int val = odd ? 1 : 2 ; val <= MN ; val += 2 ){
        int new_sum = sum - a[i] + val;
        if ((new_sum & 1) || (new_sum / 2 < val) || !ndp[new_sum / 2 - val]) choose[val] = false; 
      }
    }
    vector<int> ans;
    for ( int i = 1 ; i <= MN ; i++ ){
      if (choose[i]) ans.push_back(i);
    }
    cout << ans.size() << el;
    for ( auto x : ans ) cout << x << " ";
  }
}

int32_t main (){
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n;
  if (n <= 30) sub_trau::solve();
  else sub_final::solve();
}

Compilation message

bootfall.cpp: In function 'void sub_final::solve()':
bootfall.cpp:103:54: warning: iteration 200050 invokes undefined behavior [-Waggressive-loop-optimizations]
  103 |       for ( int j = 0 ; j <= MN ; j++ ) ndp[j] = dp[j];
      |                                                  ~~~~^
bootfall.cpp:103:27: note: within this loop
  103 |       for ( int j = 0 ; j <= MN ; j++ ) ndp[j] = dp[j];
      |                         ~~^~~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 2 ms 2504 KB Output is correct
6 Correct 3 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 4 ms 2396 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 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 2 ms 2504 KB Output is correct
6 Correct 3 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 4 ms 2396 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 2 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 0 ms 500 KB Output is correct
14 Correct 2 ms 2392 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2648 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 2 ms 2504 KB Output is correct
6 Correct 3 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 4 ms 2396 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 2 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 0 ms 500 KB Output is correct
14 Correct 2 ms 2392 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2648 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 25 ms 4188 KB Output is correct
22 Correct 32 ms 4188 KB Output is correct
23 Correct 27 ms 4188 KB Output is correct
24 Correct 38 ms 4188 KB Output is correct
25 Correct 48 ms 4240 KB Output is correct
26 Correct 44 ms 4256 KB Output is correct
27 Correct 52 ms 4232 KB Output is correct
28 Correct 43 ms 4184 KB Output is correct
29 Correct 48 ms 4236 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 43 ms 4188 KB Output is correct
32 Correct 39 ms 4188 KB Output is correct
33 Correct 40 ms 4188 KB Output is correct
34 Correct 39 ms 4188 KB Output is correct
35 Correct 50 ms 4236 KB Output is correct
36 Correct 40 ms 4196 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 2 ms 2504 KB Output is correct
6 Correct 3 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 4 ms 2396 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 2 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 0 ms 500 KB Output is correct
14 Correct 2 ms 2392 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2648 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 25 ms 4188 KB Output is correct
22 Correct 32 ms 4188 KB Output is correct
23 Correct 27 ms 4188 KB Output is correct
24 Correct 38 ms 4188 KB Output is correct
25 Correct 48 ms 4240 KB Output is correct
26 Correct 44 ms 4256 KB Output is correct
27 Correct 52 ms 4232 KB Output is correct
28 Correct 43 ms 4184 KB Output is correct
29 Correct 48 ms 4236 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 43 ms 4188 KB Output is correct
32 Correct 39 ms 4188 KB Output is correct
33 Correct 40 ms 4188 KB Output is correct
34 Correct 39 ms 4188 KB Output is correct
35 Correct 50 ms 4236 KB Output is correct
36 Correct 40 ms 4196 KB Output is correct
37 Correct 98 ms 4240 KB Output is correct
38 Correct 90 ms 4244 KB Output is correct
39 Correct 105 ms 4188 KB Output is correct
40 Correct 109 ms 4236 KB Output is correct
41 Correct 145 ms 4184 KB Output is correct
42 Correct 104 ms 4184 KB Output is correct
43 Correct 106 ms 4188 KB Output is correct
44 Correct 124 ms 4228 KB Output is correct
45 Correct 104 ms 4236 KB Output is correct
46 Correct 119 ms 4232 KB Output is correct
47 Correct 120 ms 4188 KB Output is correct
48 Correct 132 ms 4184 KB Output is correct
49 Correct 122 ms 4236 KB Output is correct
50 Correct 102 ms 4184 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 134 ms 4232 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 2 ms 2504 KB Output is correct
6 Correct 3 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 4 ms 2396 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 2 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 0 ms 500 KB Output is correct
14 Correct 2 ms 2392 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2648 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 25 ms 4188 KB Output is correct
22 Correct 32 ms 4188 KB Output is correct
23 Correct 27 ms 4188 KB Output is correct
24 Correct 38 ms 4188 KB Output is correct
25 Correct 48 ms 4240 KB Output is correct
26 Correct 44 ms 4256 KB Output is correct
27 Correct 52 ms 4232 KB Output is correct
28 Correct 43 ms 4184 KB Output is correct
29 Correct 48 ms 4236 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 43 ms 4188 KB Output is correct
32 Correct 39 ms 4188 KB Output is correct
33 Correct 40 ms 4188 KB Output is correct
34 Correct 39 ms 4188 KB Output is correct
35 Correct 50 ms 4236 KB Output is correct
36 Correct 40 ms 4196 KB Output is correct
37 Correct 98 ms 4240 KB Output is correct
38 Correct 90 ms 4244 KB Output is correct
39 Correct 105 ms 4188 KB Output is correct
40 Correct 109 ms 4236 KB Output is correct
41 Correct 145 ms 4184 KB Output is correct
42 Correct 104 ms 4184 KB Output is correct
43 Correct 106 ms 4188 KB Output is correct
44 Correct 124 ms 4228 KB Output is correct
45 Correct 104 ms 4236 KB Output is correct
46 Correct 119 ms 4232 KB Output is correct
47 Correct 120 ms 4188 KB Output is correct
48 Correct 132 ms 4184 KB Output is correct
49 Correct 122 ms 4236 KB Output is correct
50 Correct 102 ms 4184 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 134 ms 4232 KB Output is correct
53 Correct 138 ms 4240 KB Output is correct
54 Correct 182 ms 4236 KB Output is correct
55 Correct 179 ms 4492 KB Output is correct
56 Correct 134 ms 4232 KB Output is correct
57 Correct 163 ms 4508 KB Output is correct
58 Correct 173 ms 4416 KB Output is correct
59 Correct 154 ms 4388 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 179 ms 4228 KB Output is correct
62 Correct 165 ms 4492 KB Output is correct
63 Correct 161 ms 4492 KB Output is correct
64 Correct 143 ms 4488 KB Output is correct
65 Correct 141 ms 4392 KB Output is correct
66 Correct 160 ms 4232 KB Output is correct

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 2 ms 2504 KB Output is correct
6 Correct 3 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 4 ms 2396 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 2 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 0 ms 500 KB Output is correct
14 Correct 2 ms 2392 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2648 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 25 ms 4188 KB Output is correct
22 Correct 32 ms 4188 KB Output is correct
23 Correct 27 ms 4188 KB Output is correct
24 Correct 38 ms 4188 KB Output is correct
25 Correct 48 ms 4240 KB Output is correct
26 Correct 44 ms 4256 KB Output is correct
27 Correct 52 ms 4232 KB Output is correct
28 Correct 43 ms 4184 KB Output is correct
29 Correct 48 ms 4236 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 43 ms 4188 KB Output is correct
32 Correct 39 ms 4188 KB Output is correct
33 Correct 40 ms 4188 KB Output is correct
34 Correct 39 ms 4188 KB Output is correct
35 Correct 50 ms 4236 KB Output is correct
36 Correct 40 ms 4196 KB Output is correct
37 Correct 98 ms 4240 KB Output is correct
38 Correct 90 ms 4244 KB Output is correct
39 Correct 105 ms 4188 KB Output is correct
40 Correct 109 ms 4236 KB Output is correct
41 Correct 145 ms 4184 KB Output is correct
42 Correct 104 ms 4184 KB Output is correct
43 Correct 106 ms 4188 KB Output is correct
44 Correct 124 ms 4228 KB Output is correct
45 Correct 104 ms 4236 KB Output is correct
46 Correct 119 ms 4232 KB Output is correct
47 Correct 120 ms 4188 KB Output is correct
48 Correct 132 ms 4184 KB Output is correct
49 Correct 122 ms 4236 KB Output is correct
50 Correct 102 ms 4184 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 134 ms 4232 KB Output is correct
53 Correct 138 ms 4240 KB Output is correct
54 Correct 182 ms 4236 KB Output is correct
55 Correct 179 ms 4492 KB Output is correct
56 Correct 134 ms 4232 KB Output is correct
57 Correct 163 ms 4508 KB Output is correct
58 Correct 173 ms 4416 KB Output is correct
59 Correct 154 ms 4388 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 179 ms 4228 KB Output is correct
62 Correct 165 ms 4492 KB Output is correct
63 Correct 161 ms 4492 KB Output is correct
64 Correct 143 ms 4488 KB Output is correct
65 Correct 141 ms 4392 KB Output is correct
66 Correct 160 ms 4232 KB Output is correct
67 Correct 176 ms 4252 KB Output is correct
68 Correct 45 ms 2396 KB Output is correct
69 Incorrect 288 ms 6040 KB Output isn't correct
70 Halted 0 ms 0 KB -