제출 #953725

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
953725		nguyennh	Bootfall (IZhO17_bootfall)	C++14	13 / 100	1059 ms	600 KiB

bootfall

#include<bits/stdc++.h>
#define el '\n'
using namespace std ;

int n;

namespace sub_trau{
  void solve(){
    vector<int> a(n + 5);
    for ( int i = 1 ; i <= n ; i++ ) cin >> a[i];
    int sum = accumulate(a.begin() + 1 , a.begin() + n + 1 , 0);
    vector<int> ans;
    for ( int val = 1 ; val <= sum ; val++ ){
      vector<int> candidates;
      int all = sum + val;
      for ( int i = 1 ; i <= n ; i++ ) candidates.push_back(a[i]);
      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);
    }
    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();
}

컴파일 시 표준 에러 (stderr) 메시지

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

• Subtask 1: 6 / 6
• Subtask 2: 7 / 7
• Subtask 3: 0 / 15
• Subtask 4: 0 / 16
• Subtask 5: 0 / 21
• Subtask 6: 0 / 35