oj.uz

Submission #173624

# Submission time Handle Problem Language Result Execution time Memory
173624 2020-01-04T17:40:52 Z aleks5d Bootfall (IZhO17_bootfall) C++17
44 / 100
 434 ms 4596 KB 
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("O3")
#include<bits/stdc++.h>

using ll = long long int;
using ull = unsigned long long int;
using dd = double;
using ldd = long double;

namespace HASH {
  const ll mod197 = 1e9 + 7;
  const ll mod199 = 1e9 + 9;
  const ll modfft = 998244353;
  ll mod = mod199;
  void Hplus(ll& h, ll b) {
    h += b;
    if (h > mod)
      h -= mod;
  }

  void Hminus(ll& h, ll b) {
    h -= b;
    if (h < 0)
      h += mod;
  }

  void Hmuliply(ll& h, ll b) {
    h *= b;
    h %= mod;
  }

  ll Hdivider(ll x) {
    if (x < 0)
      x += mod;
    ll ans = 1;
    ll n = mod - 2;
    while (n) {
      if (n & 1)
        Hmuliply(ans, x);
      n >>= 1;
      Hmuliply(x, x);
    }
    return ans;
  }
}

namespace someUsefull {
  template<typename T1, typename T2>
    inline void checkMin(T1& a, T2 b) {
        if (a > b)
            a = b;
    }

    template<typename T1, typename T2>
    inline void checkMax(T1& a, T2 b) {
        if (a < b)
            a = b;
    }
    }

    //name spaces
    using namespace std;
using namespace HASH;
using namespace someUsefull;
//end of name spaces

//defines
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()

#define NO cout << "NO" << '\n';
#define YES cout << "YES" << '\n';
//end of defines

//debug defines
#ifdef HOME
#define debug(x) cout << #x << " " << x << endl;
#define debug_p(x) cout << #x << " " << x.ff << " " << x.ss << endl;
#define debug_v(x) {cout << #x << " "; for (auto ioi : x) cout << ioi << " "; cout << endl;}
#define debug_vp(x) {cout << #x << " "; for (auto ioi : x) cout << '[' << ioi.ff << " " << ioi.ss << ']'; cout << endl;}
#define debug_v_v(x) {cout << #x << "/*\n"; for (auto ioi : x) { for (auto ioi2 : ioi) cout << ioi2 << " "; cout << '\n';} cout << "*/" << #x << endl;}
  int jjj;
#define wait() cin >> jjj;
#define PO cout << "POMELO" << endl;
#define OL cout << "OLIVA" << endl;
#define gen_clock(x) ll x = clock(); cout << "Clock " << #x << " created" << endl;
#define check_clock(x) cout << "Time spent in " << #x << ": " << clock() - x << endl; x = clock();
#define reset_clock(x) x = clock();
#define say(x) cout << x << endl;
#else
#define debug(x) 0;
#define debug_p(x) 0;
#define debug_v(x) 0;
#define debug_vp(x) 0;
#define debug_v_v(x) 0;
#define wait() 0;
#define PO 0;
#define OL 0;
#define gen_clock(x) 0;
#define check_clock(x) 0;
#define reset_clock(x) 0;
#define say(x) 0;
#endif // HOME
//end of debug defines

void solve() {
  int n;
  cin >> n;
  vector<int> arr(n);
  for (int i = 0; i < n; ++i)
    cin >> arr[i];
  vector<ll> dp(3e5);
  vector<int> canbe(3e5, 0);
  dp[0] = 1;
  for (int i = 0; i < n; ++i) {
    for (int j = dp.size() - 1; j >= arr[i]; --j) {
      Hplus(dp[j], dp[j - arr[i]]);
    }
  }
  int ma = 0;
  for (int j = dp.size() - 1; j > 0; --j)
    if (dp[j]) {
      ma = j;
      break;
    }
  if (ma & 1) {
    cout << 0;
    return;
  }
  if (dp[ma >> 1] == 0) {
    cout << 0;
    return;
  }
  for (int i = 0; i < n; ++i) {
    if (i != -1) {
      for (int j = arr[i]; j < dp.size(); ++j) {
        Hminus(dp[j], dp[j - arr[i]]);
      }
    }
    int ma = 0;
    for (int i = dp.size() - 1; i > 0; --i) {
      if (dp[i]) {
        ma = i;
        break;
      }
    }
    debug(i);
    //vector<int> opa(dp.begin(), dp.begin() + ma + 1);
    //debug_v(opa);
    debug(ma);
    for (int i = 0; i * 2 <= ma; ++i) {
      if (dp[i]) {
        debug(i);
        debug(ma - i - i);
        ++canbe[ma - i - i];
      }
    }
    if (i != -1) {
      for (int j = dp.size() - 1; j >= arr[i]; --j) {
        Hplus(dp[j], dp[j - arr[i]]);
      }
    }
  }
  vector<int> ans;
  for (int i = 0; i < dp.size(); ++i) {
    if (canbe[i] == n) {
      ans.push_back(i);
    }
  }
  cout << ans.size() << '\n';
  for (int i : ans)
    cout << i << " ";

}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int t;
  t = 1;
  // cin >> t;
  for (int i = 0; i < t; ++i) {
    solve();
    cout << '\n';
  }
  return 0;

}

/*
    5
    3 2
    3 -2
    -2 -2
    -2 2
    0 0
    */

Compilation message

bootfall.cpp: In function 'void solve()':
bootfall.cpp:137:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       for (int j = arr[i]; j < dp.size(); ++j) {
                            ~~^~~~~~~~~~~
bootfall.cpp:92:19: warning: statement has no effect [-Wunused-value]
 #define debug(x) 0;
                   ^
bootfall.cpp:148:5: note: in expansion of macro 'debug'
     debug(i);
     ^~~~~
bootfall.cpp:92:19: warning: statement has no effect [-Wunused-value]
 #define debug(x) 0;
                   ^
bootfall.cpp:151:5: note: in expansion of macro 'debug'
     debug(ma);
     ^~~~~
bootfall.cpp:92:19: warning: statement has no effect [-Wunused-value]
 #define debug(x) 0;
                   ^
bootfall.cpp:154:9: note: in expansion of macro 'debug'
         debug(i);
         ^~~~~
bootfall.cpp:92:19: warning: statement has no effect [-Wunused-value]
 #define debug(x) 0;
                   ^
bootfall.cpp:155:9: note: in expansion of macro 'debug'
         debug(ma - i - i);
         ^~~~~
bootfall.cpp:166:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < dp.size(); ++i) {
                   ~~^~~~~~~~~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 3832 KB Output is correct
2 Correct 13 ms 3832 KB Output is correct
3 Correct 6 ms 3832 KB Output is correct
4 Correct 11 ms 3832 KB Output is correct
5 Correct 20 ms 3832 KB Output is correct
6 Correct 15 ms 3832 KB Output is correct
7 Correct 13 ms 3832 KB Output is correct
8 Correct 20 ms 3908 KB Output is correct
9 Correct 18 ms 3832 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 3832 KB Output is correct
2 Correct 13 ms 3832 KB Output is correct
3 Correct 6 ms 3832 KB Output is correct
4 Correct 11 ms 3832 KB Output is correct
5 Correct 20 ms 3832 KB Output is correct
6 Correct 15 ms 3832 KB Output is correct
7 Correct 13 ms 3832 KB Output is correct
8 Correct 20 ms 3908 KB Output is correct
9 Correct 18 ms 3832 KB Output is correct
10 Correct 42 ms 3916 KB Output is correct
11 Correct 45 ms 3832 KB Output is correct
12 Correct 43 ms 3832 KB Output is correct
13 Correct 39 ms 3952 KB Output is correct
14 Correct 41 ms 3832 KB Output is correct
15 Correct 43 ms 3832 KB Output is correct
16 Correct 46 ms 3832 KB Output is correct
17 Correct 29 ms 3832 KB Output is correct
18 Correct 36 ms 3832 KB Output is correct
19 Correct 39 ms 3832 KB Output is correct
20 Correct 42 ms 3832 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 3832 KB Output is correct
2 Correct 13 ms 3832 KB Output is correct
3 Correct 6 ms 3832 KB Output is correct
4 Correct 11 ms 3832 KB Output is correct
5 Correct 20 ms 3832 KB Output is correct
6 Correct 15 ms 3832 KB Output is correct
7 Correct 13 ms 3832 KB Output is correct
8 Correct 20 ms 3908 KB Output is correct
9 Correct 18 ms 3832 KB Output is correct
10 Correct 42 ms 3916 KB Output is correct
11 Correct 45 ms 3832 KB Output is correct
12 Correct 43 ms 3832 KB Output is correct
13 Correct 39 ms 3952 KB Output is correct
14 Correct 41 ms 3832 KB Output is correct
15 Correct 43 ms 3832 KB Output is correct
16 Correct 46 ms 3832 KB Output is correct
17 Correct 29 ms 3832 KB Output is correct
18 Correct 36 ms 3832 KB Output is correct
19 Correct 39 ms 3832 KB Output is correct
20 Correct 42 ms 3832 KB Output is correct
21 Correct 84 ms 3916 KB Output is correct
22 Correct 97 ms 3832 KB Output is correct
23 Correct 68 ms 3832 KB Output is correct
24 Correct 122 ms 3960 KB Output is correct
25 Correct 120 ms 3960 KB Output is correct
26 Correct 128 ms 3920 KB Output is correct
27 Correct 127 ms 3944 KB Output is correct
28 Correct 128 ms 3960 KB Output is correct
29 Correct 127 ms 3832 KB Output is correct
30 Correct 128 ms 3836 KB Output is correct
31 Correct 128 ms 3960 KB Output is correct
32 Correct 128 ms 3960 KB Output is correct
33 Correct 127 ms 3832 KB Output is correct
34 Correct 127 ms 3832 KB Output is correct
35 Correct 127 ms 3832 KB Output is correct
36 Correct 130 ms 3960 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 3832 KB Output is correct
2 Correct 13 ms 3832 KB Output is correct
3 Correct 6 ms 3832 KB Output is correct
4 Correct 11 ms 3832 KB Output is correct
5 Correct 20 ms 3832 KB Output is correct
6 Correct 15 ms 3832 KB Output is correct
7 Correct 13 ms 3832 KB Output is correct
8 Correct 20 ms 3908 KB Output is correct
9 Correct 18 ms 3832 KB Output is correct
10 Correct 42 ms 3916 KB Output is correct
11 Correct 45 ms 3832 KB Output is correct
12 Correct 43 ms 3832 KB Output is correct
13 Correct 39 ms 3952 KB Output is correct
14 Correct 41 ms 3832 KB Output is correct
15 Correct 43 ms 3832 KB Output is correct
16 Correct 46 ms 3832 KB Output is correct
17 Correct 29 ms 3832 KB Output is correct
18 Correct 36 ms 3832 KB Output is correct
19 Correct 39 ms 3832 KB Output is correct
20 Correct 42 ms 3832 KB Output is correct
21 Correct 84 ms 3916 KB Output is correct
22 Correct 97 ms 3832 KB Output is correct
23 Correct 68 ms 3832 KB Output is correct
24 Correct 122 ms 3960 KB Output is correct
25 Correct 120 ms 3960 KB Output is correct
26 Correct 128 ms 3920 KB Output is correct
27 Correct 127 ms 3944 KB Output is correct
28 Correct 128 ms 3960 KB Output is correct
29 Correct 127 ms 3832 KB Output is correct
30 Correct 128 ms 3836 KB Output is correct
31 Correct 128 ms 3960 KB Output is correct
32 Correct 128 ms 3960 KB Output is correct
33 Correct 127 ms 3832 KB Output is correct
34 Correct 127 ms 3832 KB Output is correct
35 Correct 127 ms 3832 KB Output is correct
36 Correct 130 ms 3960 KB Output is correct
37 Correct 249 ms 3960 KB Output is correct
38 Correct 249 ms 4040 KB Output is correct
39 Correct 304 ms 3824 KB Output is correct
40 Correct 334 ms 4088 KB Output is correct
41 Correct 333 ms 3832 KB Output is correct
42 Correct 313 ms 4088 KB Output is correct
43 Correct 304 ms 4288 KB Output is correct
44 Correct 307 ms 4344 KB Output is correct
45 Correct 310 ms 4344 KB Output is correct
46 Correct 333 ms 3960 KB Output is correct
47 Correct 310 ms 4088 KB Output is correct
48 Correct 315 ms 4220 KB Output is correct
49 Correct 309 ms 3944 KB Output is correct
50 Correct 312 ms 4088 KB Output is correct
51 Correct 94 ms 3960 KB Output is correct
52 Correct 343 ms 4332 KB Output is correct

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 3832 KB Output is correct
2 Correct 13 ms 3832 KB Output is correct
3 Correct 6 ms 3832 KB Output is correct
4 Correct 11 ms 3832 KB Output is correct
5 Correct 20 ms 3832 KB Output is correct
6 Correct 15 ms 3832 KB Output is correct
7 Correct 13 ms 3832 KB Output is correct
8 Correct 20 ms 3908 KB Output is correct
9 Correct 18 ms 3832 KB Output is correct
10 Correct 42 ms 3916 KB Output is correct
11 Correct 45 ms 3832 KB Output is correct
12 Correct 43 ms 3832 KB Output is correct
13 Correct 39 ms 3952 KB Output is correct
14 Correct 41 ms 3832 KB Output is correct
15 Correct 43 ms 3832 KB Output is correct
16 Correct 46 ms 3832 KB Output is correct
17 Correct 29 ms 3832 KB Output is correct
18 Correct 36 ms 3832 KB Output is correct
19 Correct 39 ms 3832 KB Output is correct
20 Correct 42 ms 3832 KB Output is correct
21 Correct 84 ms 3916 KB Output is correct
22 Correct 97 ms 3832 KB Output is correct
23 Correct 68 ms 3832 KB Output is correct
24 Correct 122 ms 3960 KB Output is correct
25 Correct 120 ms 3960 KB Output is correct
26 Correct 128 ms 3920 KB Output is correct
27 Correct 127 ms 3944 KB Output is correct
28 Correct 128 ms 3960 KB Output is correct
29 Correct 127 ms 3832 KB Output is correct
30 Correct 128 ms 3836 KB Output is correct
31 Correct 128 ms 3960 KB Output is correct
32 Correct 128 ms 3960 KB Output is correct
33 Correct 127 ms 3832 KB Output is correct
34 Correct 127 ms 3832 KB Output is correct
35 Correct 127 ms 3832 KB Output is correct
36 Correct 130 ms 3960 KB Output is correct
37 Correct 249 ms 3960 KB Output is correct
38 Correct 249 ms 4040 KB Output is correct
39 Correct 304 ms 3824 KB Output is correct
40 Correct 334 ms 4088 KB Output is correct
41 Correct 333 ms 3832 KB Output is correct
42 Correct 313 ms 4088 KB Output is correct
43 Correct 304 ms 4288 KB Output is correct
44 Correct 307 ms 4344 KB Output is correct
45 Correct 310 ms 4344 KB Output is correct
46 Correct 333 ms 3960 KB Output is correct
47 Correct 310 ms 4088 KB Output is correct
48 Correct 315 ms 4220 KB Output is correct
49 Correct 309 ms 3944 KB Output is correct
50 Correct 312 ms 4088 KB Output is correct
51 Correct 94 ms 3960 KB Output is correct
52 Correct 343 ms 4332 KB Output is correct
53 Correct 371 ms 4200 KB Output is correct
54 Correct 433 ms 4336 KB Output is correct
55 Correct 434 ms 4428 KB Output is correct
56 Correct 378 ms 4348 KB Output is correct
57 Correct 431 ms 4596 KB Output is correct
58 Correct 434 ms 4344 KB Output is correct
59 Incorrect 431 ms 4344 KB Output isn't correct
60 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 3832 KB Output is correct
2 Correct 13 ms 3832 KB Output is correct
3 Correct 6 ms 3832 KB Output is correct
4 Correct 11 ms 3832 KB Output is correct
5 Correct 20 ms 3832 KB Output is correct
6 Correct 15 ms 3832 KB Output is correct
7 Correct 13 ms 3832 KB Output is correct
8 Correct 20 ms 3908 KB Output is correct
9 Correct 18 ms 3832 KB Output is correct
10 Correct 42 ms 3916 KB Output is correct
11 Correct 45 ms 3832 KB Output is correct
12 Correct 43 ms 3832 KB Output is correct
13 Correct 39 ms 3952 KB Output is correct
14 Correct 41 ms 3832 KB Output is correct
15 Correct 43 ms 3832 KB Output is correct
16 Correct 46 ms 3832 KB Output is correct
17 Correct 29 ms 3832 KB Output is correct
18 Correct 36 ms 3832 KB Output is correct
19 Correct 39 ms 3832 KB Output is correct
20 Correct 42 ms 3832 KB Output is correct
21 Correct 84 ms 3916 KB Output is correct
22 Correct 97 ms 3832 KB Output is correct
23 Correct 68 ms 3832 KB Output is correct
24 Correct 122 ms 3960 KB Output is correct
25 Correct 120 ms 3960 KB Output is correct
26 Correct 128 ms 3920 KB Output is correct
27 Correct 127 ms 3944 KB Output is correct
28 Correct 128 ms 3960 KB Output is correct
29 Correct 127 ms 3832 KB Output is correct
30 Correct 128 ms 3836 KB Output is correct
31 Correct 128 ms 3960 KB Output is correct
32 Correct 128 ms 3960 KB Output is correct
33 Correct 127 ms 3832 KB Output is correct
34 Correct 127 ms 3832 KB Output is correct
35 Correct 127 ms 3832 KB Output is correct
36 Correct 130 ms 3960 KB Output is correct
37 Correct 249 ms 3960 KB Output is correct
38 Correct 249 ms 4040 KB Output is correct
39 Correct 304 ms 3824 KB Output is correct
40 Correct 334 ms 4088 KB Output is correct
41 Correct 333 ms 3832 KB Output is correct
42 Correct 313 ms 4088 KB Output is correct
43 Correct 304 ms 4288 KB Output is correct
44 Correct 307 ms 4344 KB Output is correct
45 Correct 310 ms 4344 KB Output is correct
46 Correct 333 ms 3960 KB Output is correct
47 Correct 310 ms 4088 KB Output is correct
48 Correct 315 ms 4220 KB Output is correct
49 Correct 309 ms 3944 KB Output is correct
50 Correct 312 ms 4088 KB Output is correct
51 Correct 94 ms 3960 KB Output is correct
52 Correct 343 ms 4332 KB Output is correct
53 Correct 371 ms 4200 KB Output is correct
54 Correct 433 ms 4336 KB Output is correct
55 Correct 434 ms 4428 KB Output is correct
56 Correct 378 ms 4348 KB Output is correct
57 Correct 431 ms 4596 KB Output is correct
58 Correct 434 ms 4344 KB Output is correct
59 Incorrect 431 ms 4344 KB Output isn't correct
60 Halted 0 ms 0 KB -