oj.uz

답안 #954342

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
954342 2024-03-27T16:13:04 Z nguyennh Bootfall (IZhO17_bootfall) C++14
65 / 100
 385 ms 4920 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{
  const int mod = 1e9 + 7;
  
  int64_t dp[MN];
  bool choose[MN];
  
  void solve(){
    vector<int> a(n + 5);
    for ( int i = 1 ; i <= n ; i++ ) cin >> a[i];
    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]];
        dp[j] %= mod;
      }
    }
    if (!dp[sum / 2] || (sum & 1)){
      cout << 0;
      return;
    }
    memset(choose , true , sizeof(choose));
    for ( int i = odd ? 2 : 1 ; i <= sum ; i += 2 ) choose[i] = false;
    for ( int i = 1 ; i <= n ; i++ ){
      vector<int64_t> ndp(sum + 5);
      for ( int j = 0 ; j <= sum ; j++ ) ndp[j] = dp[j];
      for ( int j = a[i] ; j <= sum ; j++ ) (ndp[j] += (mod - ndp[j - a[i]])) %= mod;
      for ( int val = odd ? 1 : 2 ; val <= sum ; 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 <= sum ; i++ ){
      if (choose[i]) ans.push_back(i);
    }
    cout << ans.size() << el;
    for ( auto x : ans ) cout << x << " ";
  }
}

int32_t main (){
//  freopen("bootfall.inp" , "r" , stdin);
//  freopen("bootfall.out" , "w" , stdout);
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n;
  if (n <= 30) sub_trau::solve();
  else sub_final::solve();
}

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 2 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 4 ms 2520 KB Output is correct
9 Correct 0 ms 348 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 2 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 4 ms 2520 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 2396 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 2396 KB Output is correct
18 Correct 1 ms 2392 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 2 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 4 ms 2520 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 2396 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 2396 KB Output is correct
18 Correct 1 ms 2392 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2652 KB Output is correct
22 Correct 1 ms 2652 KB Output is correct
23 Correct 1 ms 2652 KB Output is correct
24 Correct 2 ms 2652 KB Output is correct
25 Correct 4 ms 2804 KB Output is correct
26 Correct 4 ms 2648 KB Output is correct
27 Correct 4 ms 2652 KB Output is correct
28 Correct 4 ms 2764 KB Output is correct
29 Correct 4 ms 2652 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 3 ms 2508 KB Output is correct
32 Correct 2 ms 2648 KB Output is correct
33 Correct 4 ms 2652 KB Output is correct
34 Correct 4 ms 2652 KB Output is correct
35 Correct 5 ms 2652 KB Output is correct
36 Correct 2 ms 2652 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 2 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 4 ms 2520 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 2396 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 2396 KB Output is correct
18 Correct 1 ms 2392 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2652 KB Output is correct
22 Correct 1 ms 2652 KB Output is correct
23 Correct 1 ms 2652 KB Output is correct
24 Correct 2 ms 2652 KB Output is correct
25 Correct 4 ms 2804 KB Output is correct
26 Correct 4 ms 2648 KB Output is correct
27 Correct 4 ms 2652 KB Output is correct
28 Correct 4 ms 2764 KB Output is correct
29 Correct 4 ms 2652 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 3 ms 2508 KB Output is correct
32 Correct 2 ms 2648 KB Output is correct
33 Correct 4 ms 2652 KB Output is correct
34 Correct 4 ms 2652 KB Output is correct
35 Correct 5 ms 2652 KB Output is correct
36 Correct 2 ms 2652 KB Output is correct
37 Correct 14 ms 2756 KB Output is correct
38 Correct 15 ms 2852 KB Output is correct
39 Correct 56 ms 3144 KB Output is correct
40 Correct 31 ms 2908 KB Output is correct
41 Correct 72 ms 3236 KB Output is correct
42 Correct 28 ms 2928 KB Output is correct
43 Correct 48 ms 3224 KB Output is correct
44 Correct 49 ms 3216 KB Output is correct
45 Correct 50 ms 3104 KB Output is correct
46 Correct 31 ms 2916 KB Output is correct
47 Correct 29 ms 2904 KB Output is correct
48 Correct 55 ms 3172 KB Output is correct
49 Correct 61 ms 3156 KB Output is correct
50 Correct 30 ms 2948 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 77 ms 3240 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 2 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 4 ms 2520 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 2396 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 2396 KB Output is correct
18 Correct 1 ms 2392 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2652 KB Output is correct
22 Correct 1 ms 2652 KB Output is correct
23 Correct 1 ms 2652 KB Output is correct
24 Correct 2 ms 2652 KB Output is correct
25 Correct 4 ms 2804 KB Output is correct
26 Correct 4 ms 2648 KB Output is correct
27 Correct 4 ms 2652 KB Output is correct
28 Correct 4 ms 2764 KB Output is correct
29 Correct 4 ms 2652 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 3 ms 2508 KB Output is correct
32 Correct 2 ms 2648 KB Output is correct
33 Correct 4 ms 2652 KB Output is correct
34 Correct 4 ms 2652 KB Output is correct
35 Correct 5 ms 2652 KB Output is correct
36 Correct 2 ms 2652 KB Output is correct
37 Correct 14 ms 2756 KB Output is correct
38 Correct 15 ms 2852 KB Output is correct
39 Correct 56 ms 3144 KB Output is correct
40 Correct 31 ms 2908 KB Output is correct
41 Correct 72 ms 3236 KB Output is correct
42 Correct 28 ms 2928 KB Output is correct
43 Correct 48 ms 3224 KB Output is correct
44 Correct 49 ms 3216 KB Output is correct
45 Correct 50 ms 3104 KB Output is correct
46 Correct 31 ms 2916 KB Output is correct
47 Correct 29 ms 2904 KB Output is correct
48 Correct 55 ms 3172 KB Output is correct
49 Correct 61 ms 3156 KB Output is correct
50 Correct 30 ms 2948 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 77 ms 3240 KB Output is correct
53 Correct 51 ms 3024 KB Output is correct
54 Correct 69 ms 3216 KB Output is correct
55 Correct 138 ms 3788 KB Output is correct
56 Correct 60 ms 3224 KB Output is correct
57 Correct 146 ms 3756 KB Output is correct
58 Correct 76 ms 3164 KB Output is correct
59 Correct 95 ms 3260 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 105 ms 3332 KB Output is correct
62 Correct 110 ms 3660 KB Output is correct
63 Correct 117 ms 3608 KB Output is correct
64 Correct 116 ms 3716 KB Output is correct
65 Correct 56 ms 3040 KB Output is correct
66 Correct 60 ms 3096 KB Output is correct

Subtask #6
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 2 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 4 ms 2520 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 2396 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 2396 KB Output is correct
18 Correct 1 ms 2392 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2652 KB Output is correct
22 Correct 1 ms 2652 KB Output is correct
23 Correct 1 ms 2652 KB Output is correct
24 Correct 2 ms 2652 KB Output is correct
25 Correct 4 ms 2804 KB Output is correct
26 Correct 4 ms 2648 KB Output is correct
27 Correct 4 ms 2652 KB Output is correct
28 Correct 4 ms 2764 KB Output is correct
29 Correct 4 ms 2652 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 3 ms 2508 KB Output is correct
32 Correct 2 ms 2648 KB Output is correct
33 Correct 4 ms 2652 KB Output is correct
34 Correct 4 ms 2652 KB Output is correct
35 Correct 5 ms 2652 KB Output is correct
36 Correct 2 ms 2652 KB Output is correct
37 Correct 14 ms 2756 KB Output is correct
38 Correct 15 ms 2852 KB Output is correct
39 Correct 56 ms 3144 KB Output is correct
40 Correct 31 ms 2908 KB Output is correct
41 Correct 72 ms 3236 KB Output is correct
42 Correct 28 ms 2928 KB Output is correct
43 Correct 48 ms 3224 KB Output is correct
44 Correct 49 ms 3216 KB Output is correct
45 Correct 50 ms 3104 KB Output is correct
46 Correct 31 ms 2916 KB Output is correct
47 Correct 29 ms 2904 KB Output is correct
48 Correct 55 ms 3172 KB Output is correct
49 Correct 61 ms 3156 KB Output is correct
50 Correct 30 ms 2948 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 77 ms 3240 KB Output is correct
53 Correct 51 ms 3024 KB Output is correct
54 Correct 69 ms 3216 KB Output is correct
55 Correct 138 ms 3788 KB Output is correct
56 Correct 60 ms 3224 KB Output is correct
57 Correct 146 ms 3756 KB Output is correct
58 Correct 76 ms 3164 KB Output is correct
59 Correct 95 ms 3260 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 105 ms 3332 KB Output is correct
62 Correct 110 ms 3660 KB Output is correct
63 Correct 117 ms 3608 KB Output is correct
64 Correct 116 ms 3716 KB Output is correct
65 Correct 56 ms 3040 KB Output is correct
66 Correct 60 ms 3096 KB Output is correct
67 Correct 119 ms 3296 KB Output is correct
68 Correct 88 ms 2392 KB Output is correct
69 Incorrect 385 ms 4920 KB Output isn't correct
70 Halted 0 ms 0 KB -