Submission #1047470

#	Time	Username	Problem	Language	Result	Execution time	Memory
1047470		adrielcp	Bootfall (IZhO17_bootfall)	C++17	100 / 100	275 ms	6092 KiB

bootfall

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define lld double
#define int ll
#define usaco(fname) freopen(#fname ".in","r",stdin);freopen(#fname ".out","w",stdout);
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
// const ll INF = 1e18;
const int INF = 1e9;
const int mod = 1e9+7;
const lld PI = acos(-1.0);
int di[] = {1, -1, 0, 0, 1, 1, -1, -1};
int dj[] = {0, 0, 1, -1, 1, -1, 1, -1};
#define debug(x) cout << #x << ": " << x << endl;
#define add(a, b) a += b, a %= mod
#define mul(a, b) ((a % mod) * (b % mod)) % mod
#define all(x) x.begin(),x.end()

const int N = 25e4 + 69;
void solve() {
  int n;cin>>n;
  vector<int> a(n);
  for (int i = 0; i < n; i++) cin >> a[i];
  int sm = accumulate(all(a),0ll);

  vector<int> dp(N);
  dp[0] = 1;
  for (int i = 0; i < n; i++) for (int j = sm; j >= a[i]; j--) dp[j] += dp[j-a[i]];

  if (sm % 2 != 0 || !dp[sm/2]) {
    cout << 0 << endl;
    return;
  }

  vector<int> ans(N);
  for (int i = 0; i < n; i++) {
    for (int j = a[i]; j <= sm; j++) dp[j] -= dp[j-a[i]];
    for (int j = 1; j <= sm; j++) {
      int nowsum = sm + j - a[i];
      if (nowsum % 2 == 0 && dp[nowsum/2]) ans[j]++;
    }
    for (int j = sm; j >= a[i]; j--) dp[j] += dp[j-a[i]];
  }

  vector<int> res;
  for (int i = 1; i < N; i++) if (ans[i] == n) res.push_back(i);

  cout << res.size() << endl;
  for (auto el : res) cout << el << " ";

  // set<int> st;
  // for (int i = 0; i < N; i++) if (vis[i]) st.insert(i);

  // cout << st << endl;
}

int32_t main() {
  ios_base::sync_with_stdio(0);cin.tie(0);
  int t=1;
  while(t--) solve();

  return 0;
}

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