oj.uz

Submission #986908

# Submission time Handle Problem Language Result Execution time Memory
986908 2024-05-21T14:36:13 Z arush_agu Bootfall (IZhO17_bootfall) C++17
100 / 100
 580 ms 6120 KB 
#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

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

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 4440 KB Output is correct
2 Correct 8 ms 4444 KB Output is correct
3 Correct 3 ms 4444 KB Output is correct
4 Correct 6 ms 4464 KB Output is correct
5 Correct 15 ms 4444 KB Output is correct
6 Correct 10 ms 4444 KB Output is correct
7 Correct 8 ms 4444 KB Output is correct
8 Correct 15 ms 4440 KB Output is correct
9 Correct 13 ms 4444 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 4440 KB Output is correct
2 Correct 8 ms 4444 KB Output is correct
3 Correct 3 ms 4444 KB Output is correct
4 Correct 6 ms 4464 KB Output is correct
5 Correct 15 ms 4444 KB Output is correct
6 Correct 10 ms 4444 KB Output is correct
7 Correct 8 ms 4444 KB Output is correct
8 Correct 15 ms 4440 KB Output is correct
9 Correct 13 ms 4444 KB Output is correct
10 Correct 34 ms 4444 KB Output is correct
11 Correct 41 ms 4472 KB Output is correct
12 Correct 35 ms 4696 KB Output is correct
13 Correct 33 ms 4460 KB Output is correct
14 Correct 34 ms 4444 KB Output is correct
15 Correct 42 ms 4696 KB Output is correct
16 Correct 43 ms 4444 KB Output is correct
17 Correct 23 ms 4440 KB Output is correct
18 Correct 30 ms 4444 KB Output is correct
19 Correct 33 ms 4460 KB Output is correct
20 Correct 35 ms 4444 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 4440 KB Output is correct
2 Correct 8 ms 4444 KB Output is correct
3 Correct 3 ms 4444 KB Output is correct
4 Correct 6 ms 4464 KB Output is correct
5 Correct 15 ms 4444 KB Output is correct
6 Correct 10 ms 4444 KB Output is correct
7 Correct 8 ms 4444 KB Output is correct
8 Correct 15 ms 4440 KB Output is correct
9 Correct 13 ms 4444 KB Output is correct
10 Correct 34 ms 4444 KB Output is correct
11 Correct 41 ms 4472 KB Output is correct
12 Correct 35 ms 4696 KB Output is correct
13 Correct 33 ms 4460 KB Output is correct
14 Correct 34 ms 4444 KB Output is correct
15 Correct 42 ms 4696 KB Output is correct
16 Correct 43 ms 4444 KB Output is correct
17 Correct 23 ms 4440 KB Output is correct
18 Correct 30 ms 4444 KB Output is correct
19 Correct 33 ms 4460 KB Output is correct
20 Correct 35 ms 4444 KB Output is correct
21 Correct 73 ms 4444 KB Output is correct
22 Correct 89 ms 4688 KB Output is correct
23 Correct 58 ms 4440 KB Output is correct
24 Correct 107 ms 4444 KB Output is correct
25 Correct 103 ms 4456 KB Output is correct
26 Correct 109 ms 4444 KB Output is correct
27 Correct 108 ms 4448 KB Output is correct
28 Correct 108 ms 4440 KB Output is correct
29 Correct 112 ms 4440 KB Output is correct
30 Correct 112 ms 4444 KB Output is correct
31 Correct 110 ms 4444 KB Output is correct
32 Correct 110 ms 4444 KB Output is correct
33 Correct 108 ms 4444 KB Output is correct
34 Correct 110 ms 4444 KB Output is correct
35 Correct 114 ms 4444 KB Output is correct
36 Correct 114 ms 4448 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 4440 KB Output is correct
2 Correct 8 ms 4444 KB Output is correct
3 Correct 3 ms 4444 KB Output is correct
4 Correct 6 ms 4464 KB Output is correct
5 Correct 15 ms 4444 KB Output is correct
6 Correct 10 ms 4444 KB Output is correct
7 Correct 8 ms 4444 KB Output is correct
8 Correct 15 ms 4440 KB Output is correct
9 Correct 13 ms 4444 KB Output is correct
10 Correct 34 ms 4444 KB Output is correct
11 Correct 41 ms 4472 KB Output is correct
12 Correct 35 ms 4696 KB Output is correct
13 Correct 33 ms 4460 KB Output is correct
14 Correct 34 ms 4444 KB Output is correct
15 Correct 42 ms 4696 KB Output is correct
16 Correct 43 ms 4444 KB Output is correct
17 Correct 23 ms 4440 KB Output is correct
18 Correct 30 ms 4444 KB Output is correct
19 Correct 33 ms 4460 KB Output is correct
20 Correct 35 ms 4444 KB Output is correct
21 Correct 73 ms 4444 KB Output is correct
22 Correct 89 ms 4688 KB Output is correct
23 Correct 58 ms 4440 KB Output is correct
24 Correct 107 ms 4444 KB Output is correct
25 Correct 103 ms 4456 KB Output is correct
26 Correct 109 ms 4444 KB Output is correct
27 Correct 108 ms 4448 KB Output is correct
28 Correct 108 ms 4440 KB Output is correct
29 Correct 112 ms 4440 KB Output is correct
30 Correct 112 ms 4444 KB Output is correct
31 Correct 110 ms 4444 KB Output is correct
32 Correct 110 ms 4444 KB Output is correct
33 Correct 108 ms 4444 KB Output is correct
34 Correct 110 ms 4444 KB Output is correct
35 Correct 114 ms 4444 KB Output is correct
36 Correct 114 ms 4448 KB Output is correct
37 Correct 215 ms 4688 KB Output is correct
38 Correct 216 ms 4464 KB Output is correct
39 Correct 269 ms 4444 KB Output is correct
40 Correct 293 ms 4688 KB Output is correct
41 Correct 303 ms 4444 KB Output is correct
42 Correct 272 ms 4688 KB Output is correct
43 Correct 268 ms 5072 KB Output is correct
44 Correct 271 ms 4824 KB Output is correct
45 Correct 275 ms 4820 KB Output is correct
46 Correct 292 ms 4444 KB Output is correct
47 Correct 275 ms 4712 KB Output is correct
48 Correct 278 ms 4828 KB Output is correct
49 Correct 272 ms 4692 KB Output is correct
50 Correct 282 ms 4700 KB Output is correct
51 Correct 70 ms 4448 KB Output is correct
52 Correct 297 ms 4832 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 4440 KB Output is correct
2 Correct 8 ms 4444 KB Output is correct
3 Correct 3 ms 4444 KB Output is correct
4 Correct 6 ms 4464 KB Output is correct
5 Correct 15 ms 4444 KB Output is correct
6 Correct 10 ms 4444 KB Output is correct
7 Correct 8 ms 4444 KB Output is correct
8 Correct 15 ms 4440 KB Output is correct
9 Correct 13 ms 4444 KB Output is correct
10 Correct 34 ms 4444 KB Output is correct
11 Correct 41 ms 4472 KB Output is correct
12 Correct 35 ms 4696 KB Output is correct
13 Correct 33 ms 4460 KB Output is correct
14 Correct 34 ms 4444 KB Output is correct
15 Correct 42 ms 4696 KB Output is correct
16 Correct 43 ms 4444 KB Output is correct
17 Correct 23 ms 4440 KB Output is correct
18 Correct 30 ms 4444 KB Output is correct
19 Correct 33 ms 4460 KB Output is correct
20 Correct 35 ms 4444 KB Output is correct
21 Correct 73 ms 4444 KB Output is correct
22 Correct 89 ms 4688 KB Output is correct
23 Correct 58 ms 4440 KB Output is correct
24 Correct 107 ms 4444 KB Output is correct
25 Correct 103 ms 4456 KB Output is correct
26 Correct 109 ms 4444 KB Output is correct
27 Correct 108 ms 4448 KB Output is correct
28 Correct 108 ms 4440 KB Output is correct
29 Correct 112 ms 4440 KB Output is correct
30 Correct 112 ms 4444 KB Output is correct
31 Correct 110 ms 4444 KB Output is correct
32 Correct 110 ms 4444 KB Output is correct
33 Correct 108 ms 4444 KB Output is correct
34 Correct 110 ms 4444 KB Output is correct
35 Correct 114 ms 4444 KB Output is correct
36 Correct 114 ms 4448 KB Output is correct
37 Correct 215 ms 4688 KB Output is correct
38 Correct 216 ms 4464 KB Output is correct
39 Correct 269 ms 4444 KB Output is correct
40 Correct 293 ms 4688 KB Output is correct
41 Correct 303 ms 4444 KB Output is correct
42 Correct 272 ms 4688 KB Output is correct
43 Correct 268 ms 5072 KB Output is correct
44 Correct 271 ms 4824 KB Output is correct
45 Correct 275 ms 4820 KB Output is correct
46 Correct 292 ms 4444 KB Output is correct
47 Correct 275 ms 4712 KB Output is correct
48 Correct 278 ms 4828 KB Output is correct
49 Correct 272 ms 4692 KB Output is correct
50 Correct 282 ms 4700 KB Output is correct
51 Correct 70 ms 4448 KB Output is correct
52 Correct 297 ms 4832 KB Output is correct
53 Correct 332 ms 4828 KB Output is correct
54 Correct 400 ms 4836 KB Output is correct
55 Correct 397 ms 5104 KB Output is correct
56 Correct 335 ms 4816 KB Output is correct
57 Correct 391 ms 5328 KB Output is correct
58 Correct 420 ms 4816 KB Output is correct
59 Correct 384 ms 5332 KB Output is correct
60 Correct 98 ms 4440 KB Output is correct
61 Correct 394 ms 4964 KB Output is correct
62 Correct 353 ms 5072 KB Output is correct
63 Correct 361 ms 5088 KB Output is correct
64 Correct 345 ms 5088 KB Output is correct
65 Correct 348 ms 4452 KB Output is correct
66 Correct 337 ms 4468 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 4440 KB Output is correct
2 Correct 8 ms 4444 KB Output is correct
3 Correct 3 ms 4444 KB Output is correct
4 Correct 6 ms 4464 KB Output is correct
5 Correct 15 ms 4444 KB Output is correct
6 Correct 10 ms 4444 KB Output is correct
7 Correct 8 ms 4444 KB Output is correct
8 Correct 15 ms 4440 KB Output is correct
9 Correct 13 ms 4444 KB Output is correct
10 Correct 34 ms 4444 KB Output is correct
11 Correct 41 ms 4472 KB Output is correct
12 Correct 35 ms 4696 KB Output is correct
13 Correct 33 ms 4460 KB Output is correct
14 Correct 34 ms 4444 KB Output is correct
15 Correct 42 ms 4696 KB Output is correct
16 Correct 43 ms 4444 KB Output is correct
17 Correct 23 ms 4440 KB Output is correct
18 Correct 30 ms 4444 KB Output is correct
19 Correct 33 ms 4460 KB Output is correct
20 Correct 35 ms 4444 KB Output is correct
21 Correct 73 ms 4444 KB Output is correct
22 Correct 89 ms 4688 KB Output is correct
23 Correct 58 ms 4440 KB Output is correct
24 Correct 107 ms 4444 KB Output is correct
25 Correct 103 ms 4456 KB Output is correct
26 Correct 109 ms 4444 KB Output is correct
27 Correct 108 ms 4448 KB Output is correct
28 Correct 108 ms 4440 KB Output is correct
29 Correct 112 ms 4440 KB Output is correct
30 Correct 112 ms 4444 KB Output is correct
31 Correct 110 ms 4444 KB Output is correct
32 Correct 110 ms 4444 KB Output is correct
33 Correct 108 ms 4444 KB Output is correct
34 Correct 110 ms 4444 KB Output is correct
35 Correct 114 ms 4444 KB Output is correct
36 Correct 114 ms 4448 KB Output is correct
37 Correct 215 ms 4688 KB Output is correct
38 Correct 216 ms 4464 KB Output is correct
39 Correct 269 ms 4444 KB Output is correct
40 Correct 293 ms 4688 KB Output is correct
41 Correct 303 ms 4444 KB Output is correct
42 Correct 272 ms 4688 KB Output is correct
43 Correct 268 ms 5072 KB Output is correct
44 Correct 271 ms 4824 KB Output is correct
45 Correct 275 ms 4820 KB Output is correct
46 Correct 292 ms 4444 KB Output is correct
47 Correct 275 ms 4712 KB Output is correct
48 Correct 278 ms 4828 KB Output is correct
49 Correct 272 ms 4692 KB Output is correct
50 Correct 282 ms 4700 KB Output is correct
51 Correct 70 ms 4448 KB Output is correct
52 Correct 297 ms 4832 KB Output is correct
53 Correct 332 ms 4828 KB Output is correct
54 Correct 400 ms 4836 KB Output is correct
55 Correct 397 ms 5104 KB Output is correct
56 Correct 335 ms 4816 KB Output is correct
57 Correct 391 ms 5328 KB Output is correct
58 Correct 420 ms 4816 KB Output is correct
59 Correct 384 ms 5332 KB Output is correct
60 Correct 98 ms 4440 KB Output is correct
61 Correct 394 ms 4964 KB Output is correct
62 Correct 353 ms 5072 KB Output is correct
63 Correct 361 ms 5088 KB Output is correct
64 Correct 345 ms 5088 KB Output is correct
65 Correct 348 ms 4452 KB Output is correct
66 Correct 337 ms 4468 KB Output is correct
67 Correct 445 ms 5088 KB Output is correct
68 Correct 141 ms 4444 KB Output is correct
69 Correct 570 ms 5936 KB Output is correct
70 Correct 559 ms 5344 KB Output is correct
71 Correct 555 ms 5356 KB Output is correct
72 Correct 571 ms 4444 KB Output is correct
73 Correct 556 ms 4448 KB Output is correct
74 Correct 572 ms 6112 KB Output is correct
75 Correct 574 ms 5844 KB Output is correct
76 Correct 580 ms 5848 KB Output is correct
77 Correct 574 ms 6120 KB Output is correct