Submission #986908

#	Time	Username	Problem	Language	Result	Execution time	Memory
986908		arush_agu	Bootfall (IZhO17_bootfall)	C++17	100 / 100	580 ms	6120 KiB

bootfall

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

#ifdef DEBUG
#include <time.h>
#endif

#define all(a) (a).begin(), (a).end()
#define rev(a) (a).rbegin(), (a).rend()
#define F first
#define S second
int recur_depth = 0;
#ifdef DEBUG
#define dbg(x)                                                                 \
  {                                                                            \
    ++recur_depth;                                                             \
    auto x_ = x;                                                               \
    --recur_depth;                                                             \
    cerr << string(recur_depth, '\t') << "\e[91m" << __func__ << ":"           \
         << __LINE__ << "\t" << #x << " = " << x_ << "\e[39m" << endl;         \
  }
#else
#define dbg(x)
#endif

using namespace std;
using namespace __gnu_pbds;

typedef pair<int, int> ii;

typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> llll;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pair<int, int>> vii;
typedef vector<vii> vvii;

typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pair<ll, ll>> vll;
typedef vector<vll> vvll;

typedef vector<bool> vb;

template <class type1>
using ordered_set = tree<type1, null_type, less<type1>, rb_tree_tag,
                         tree_order_statistics_node_update>;

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 MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ll INF = 1e9;
const ld EPS = 1e-9;

void solve() {
  ll n; cin >> n;
  vl a(n); for (ll &x : a) cin >> x;

  vl dp(505 * 505), cnt(505 * 505);
  auto add = [&](ll x) {
    for (ll i=500 * 500; i>=x; i--) dp[i] += dp[i - x], dp[i] %= MOD;
  };
  auto rm = [&](ll x) {
    for (ll i=x; i<=500 * 500; i++) dp[i] -= dp[i - x], dp[i] %= MOD, dp[i] += MOD, dp[i] %= MOD;
  };

  dp[0] = 1;
  for (ll i=0; i<n; i++) add(a[i]);

  ll s = accumulate(all(a), 0LL);
  if (s % 2 == 1 || dp[s / 2] == 0) {
    cout << "0\n"; return;
  }

  for (ll i=0; i<n; i++) {
    rm(a[i]);
    s -= a[i];

    for (ll v=0; v<=s / 2; v++) if (dp[v] > 0) cnt[s - 2 * v]++;

    add(a[i]);
    s += a[i];
  }

  vl ans;
  for (ll i=1; i<=500 * 500; i++) if (cnt[i] == n) ans.push_back(i);

  cout << ans.size() << "\n";
  for (ll &x : ans) cout << x << ' ';
  cout << "\n";
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);

  clock_t start = clock();

  int test_cases = 1;
  // cin >> test_cases;

  while (test_cases--)
    solve();

#ifdef DEBUG
  cerr << fixed << setprecision(10)
       << "\nTime Taken: " << (double)(clock() - start) / CLOCKS_PER_SEC
       << "s\n";
#endif
  return 0;
}

Compilation message (stderr)

bootfall.cpp: In function 'int main()':
bootfall.cpp:137:11: warning: unused variable 'start' [-Wunused-variable]
  137 |   clock_t start = clock();
      |           ^~~~~

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