oj.uz

Submission #392916

# Submission time Handle Problem Language Result Execution time Memory
392916 2021-04-22T09:51:30 Z SoGood Bootfall (IZhO17_bootfall) C++17
44 / 100
 1000 ms 708 KB 
//#pragma GCC optimize ("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("avx,avx2,fma")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#define pb push_back
#define F first
#define S second
#define ins insert
#define mp make_pair
#define fo(i, n1, n, x) for(int i = n1; i <= n; i += x)
#define foo(i, n, n1, x) for(int i = n; i >= n1; i -= x)
#define bit __builtin_popcount
#define md (l + ((r - l) / 2))
#define all(x) x.begin(),x.end()
#define eb emplace_back
#define ub upper_bound
#define lb lower_bound
#define ios ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)

using namespace std;
//using namespace __gnu_pbds;
//using namespace __gnu_cxx;


using ll = long long;

//#define int ll

using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<int>;



const int N = 2e5 + 11, mod = 1e9 + 7, mod2 = 998244353;
const int MAX = 1e5 + 11;
const int INF1 = 2e9 + 11;
const ll INF2 = 6e18 + 11;
const double INF3 = 1e8 + 11;
const int base = 500;
const int P = 31;
const int dx[] = {1, -1, 0, 0, 1, 1, -1, -1};
const int dy[] = {0, 0, 1, -1, 1, -1, 1, -1};
const double EPS = 1e-4;
const double PI = acos(-1.0);


//template<typename T> using ordered_set = tree <T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T1, typename T2> inline void chmin(T1 &a, T2 b) { if (a > b) a = b; }
template<typename T1, typename T2> inline void chmax(T1 &a, T2 b) { if (a < b) a = b; }


mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int rnd(int l, int r) { return uniform_int_distribution<int> (l, r)(rng); }

int n, a[555], pref[555], sum[555];
bitset <250005> dp, ans, cur;
main() {
  file("paint");
  ios;
  cin >> n;
  fo(i, 1, n, 1) cin >> a[i], pref[i] = pref[i - 1] + a[i];
  fo(i, 1, n, 1) sum[i] = pref[i - 1] + pref[n] - pref[i];
  fo(i, 0, 250000, 1) ans.set(i);
  fo(i, 1, n + 1, 1) {
    dp.reset();
    bool t = 0;
    fo(j, 1, n, 1) {
      if (i != j) {
        if (!t) {
          dp[a[j]]=dp[0]=1;
          t = 1;
          continue;
        }
        dp |= ((dp << a[j]));
      }
    }
    if (i == n + 1) {
      if (pref[n] % 2 || !dp.test(pref[n] / 2)) return !(cout << "0");
      break;
    }
    cur.reset();
    fo(j, 0, 250000, 1) if (dp.test(j)) {
      int left = sum[i] - j;
      cur[abs(j - left)] = 1;//, cerr << "CH " << i << " " << abs(j - left) << "\n";
    }
    ans &= cur;
//    cerr << "CH " << ans.any() << '\n';
  }
  cout << ans.count() << "\n";
  fo(i, 0, 250000, 1) if (ans.test(i)) cout << i << " ";
  return 0;
}
/**
500000
250000

4
1 3 1 5

6
3 5 7 11 9 13

3
2 2 2
*/

Compilation message

bootfall.cpp:63:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   63 | main() {
      |      ^
bootfall.cpp: In function 'int main()':
bootfall.cpp:23:48: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   23 | #define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
      |                                         ~~~~~~~^~~~~~~~~~~~~~~~~~~~
bootfall.cpp:64:3: note: in expansion of macro 'file'
   64 |   file("paint");
      |   ^~~~
bootfall.cpp:23:77: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   23 | #define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
      |                                                                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
bootfall.cpp:64:3: note: in expansion of macro 'file'
   64 |   file("paint");
      |   ^~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 472 KB Output is correct
2 Correct 4 ms 460 KB Output is correct
3 Correct 2 ms 460 KB Output is correct
4 Correct 3 ms 476 KB Output is correct
5 Correct 8 ms 472 KB Output is correct
6 Correct 5 ms 460 KB Output is correct
7 Correct 4 ms 460 KB Output is correct
8 Correct 7 ms 460 KB Output is correct
9 Correct 6 ms 472 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 472 KB Output is correct
2 Correct 4 ms 460 KB Output is correct
3 Correct 2 ms 460 KB Output is correct
4 Correct 3 ms 476 KB Output is correct
5 Correct 8 ms 472 KB Output is correct
6 Correct 5 ms 460 KB Output is correct
7 Correct 4 ms 460 KB Output is correct
8 Correct 7 ms 460 KB Output is correct
9 Correct 6 ms 472 KB Output is correct
10 Correct 22 ms 476 KB Output is correct
11 Correct 26 ms 476 KB Output is correct
12 Correct 22 ms 472 KB Output is correct
13 Correct 18 ms 460 KB Output is correct
14 Correct 21 ms 456 KB Output is correct
15 Correct 22 ms 468 KB Output is correct
16 Correct 31 ms 460 KB Output is correct
17 Correct 15 ms 480 KB Output is correct
18 Correct 17 ms 460 KB Output is correct
19 Correct 19 ms 476 KB Output is correct
20 Correct 22 ms 460 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 472 KB Output is correct
2 Correct 4 ms 460 KB Output is correct
3 Correct 2 ms 460 KB Output is correct
4 Correct 3 ms 476 KB Output is correct
5 Correct 8 ms 472 KB Output is correct
6 Correct 5 ms 460 KB Output is correct
7 Correct 4 ms 460 KB Output is correct
8 Correct 7 ms 460 KB Output is correct
9 Correct 6 ms 472 KB Output is correct
10 Correct 22 ms 476 KB Output is correct
11 Correct 26 ms 476 KB Output is correct
12 Correct 22 ms 472 KB Output is correct
13 Correct 18 ms 460 KB Output is correct
14 Correct 21 ms 456 KB Output is correct
15 Correct 22 ms 468 KB Output is correct
16 Correct 31 ms 460 KB Output is correct
17 Correct 15 ms 480 KB Output is correct
18 Correct 17 ms 460 KB Output is correct
19 Correct 19 ms 476 KB Output is correct
20 Correct 22 ms 460 KB Output is correct
21 Correct 71 ms 464 KB Output is correct
22 Correct 90 ms 460 KB Output is correct
23 Correct 49 ms 464 KB Output is correct
24 Correct 133 ms 468 KB Output is correct
25 Correct 138 ms 460 KB Output is correct
26 Correct 150 ms 460 KB Output is correct
27 Correct 145 ms 464 KB Output is correct
28 Correct 147 ms 460 KB Output is correct
29 Correct 147 ms 460 KB Output is correct
30 Correct 147 ms 460 KB Output is correct
31 Correct 151 ms 460 KB Output is correct
32 Correct 148 ms 464 KB Output is correct
33 Correct 146 ms 460 KB Output is correct
34 Correct 146 ms 460 KB Output is correct
35 Correct 147 ms 460 KB Output is correct
36 Correct 175 ms 460 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 472 KB Output is correct
2 Correct 4 ms 460 KB Output is correct
3 Correct 2 ms 460 KB Output is correct
4 Correct 3 ms 476 KB Output is correct
5 Correct 8 ms 472 KB Output is correct
6 Correct 5 ms 460 KB Output is correct
7 Correct 4 ms 460 KB Output is correct
8 Correct 7 ms 460 KB Output is correct
9 Correct 6 ms 472 KB Output is correct
10 Correct 22 ms 476 KB Output is correct
11 Correct 26 ms 476 KB Output is correct
12 Correct 22 ms 472 KB Output is correct
13 Correct 18 ms 460 KB Output is correct
14 Correct 21 ms 456 KB Output is correct
15 Correct 22 ms 468 KB Output is correct
16 Correct 31 ms 460 KB Output is correct
17 Correct 15 ms 480 KB Output is correct
18 Correct 17 ms 460 KB Output is correct
19 Correct 19 ms 476 KB Output is correct
20 Correct 22 ms 460 KB Output is correct
21 Correct 71 ms 464 KB Output is correct
22 Correct 90 ms 460 KB Output is correct
23 Correct 49 ms 464 KB Output is correct
24 Correct 133 ms 468 KB Output is correct
25 Correct 138 ms 460 KB Output is correct
26 Correct 150 ms 460 KB Output is correct
27 Correct 145 ms 464 KB Output is correct
28 Correct 147 ms 460 KB Output is correct
29 Correct 147 ms 460 KB Output is correct
30 Correct 147 ms 460 KB Output is correct
31 Correct 151 ms 460 KB Output is correct
32 Correct 148 ms 464 KB Output is correct
33 Correct 146 ms 460 KB Output is correct
34 Correct 146 ms 460 KB Output is correct
35 Correct 147 ms 460 KB Output is correct
36 Correct 175 ms 460 KB Output is correct
37 Correct 527 ms 452 KB Output is correct
38 Correct 522 ms 460 KB Output is correct
39 Correct 764 ms 460 KB Output is correct
40 Correct 924 ms 460 KB Output is correct
41 Correct 886 ms 580 KB Output is correct
42 Correct 801 ms 460 KB Output is correct
43 Correct 781 ms 708 KB Output is correct
44 Correct 813 ms 596 KB Output is correct
45 Correct 834 ms 588 KB Output is correct
46 Correct 917 ms 468 KB Output is correct
47 Correct 806 ms 460 KB Output is correct
48 Correct 822 ms 460 KB Output is correct
49 Correct 795 ms 464 KB Output is correct
50 Correct 800 ms 460 KB Output is correct
51 Correct 800 ms 452 KB Output is correct
52 Correct 966 ms 592 KB Output is correct

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 472 KB Output is correct
2 Correct 4 ms 460 KB Output is correct
3 Correct 2 ms 460 KB Output is correct
4 Correct 3 ms 476 KB Output is correct
5 Correct 8 ms 472 KB Output is correct
6 Correct 5 ms 460 KB Output is correct
7 Correct 4 ms 460 KB Output is correct
8 Correct 7 ms 460 KB Output is correct
9 Correct 6 ms 472 KB Output is correct
10 Correct 22 ms 476 KB Output is correct
11 Correct 26 ms 476 KB Output is correct
12 Correct 22 ms 472 KB Output is correct
13 Correct 18 ms 460 KB Output is correct
14 Correct 21 ms 456 KB Output is correct
15 Correct 22 ms 468 KB Output is correct
16 Correct 31 ms 460 KB Output is correct
17 Correct 15 ms 480 KB Output is correct
18 Correct 17 ms 460 KB Output is correct
19 Correct 19 ms 476 KB Output is correct
20 Correct 22 ms 460 KB Output is correct
21 Correct 71 ms 464 KB Output is correct
22 Correct 90 ms 460 KB Output is correct
23 Correct 49 ms 464 KB Output is correct
24 Correct 133 ms 468 KB Output is correct
25 Correct 138 ms 460 KB Output is correct
26 Correct 150 ms 460 KB Output is correct
27 Correct 145 ms 464 KB Output is correct
28 Correct 147 ms 460 KB Output is correct
29 Correct 147 ms 460 KB Output is correct
30 Correct 147 ms 460 KB Output is correct
31 Correct 151 ms 460 KB Output is correct
32 Correct 148 ms 464 KB Output is correct
33 Correct 146 ms 460 KB Output is correct
34 Correct 146 ms 460 KB Output is correct
35 Correct 147 ms 460 KB Output is correct
36 Correct 175 ms 460 KB Output is correct
37 Correct 527 ms 452 KB Output is correct
38 Correct 522 ms 460 KB Output is correct
39 Correct 764 ms 460 KB Output is correct
40 Correct 924 ms 460 KB Output is correct
41 Correct 886 ms 580 KB Output is correct
42 Correct 801 ms 460 KB Output is correct
43 Correct 781 ms 708 KB Output is correct
44 Correct 813 ms 596 KB Output is correct
45 Correct 834 ms 588 KB Output is correct
46 Correct 917 ms 468 KB Output is correct
47 Correct 806 ms 460 KB Output is correct
48 Correct 822 ms 460 KB Output is correct
49 Correct 795 ms 464 KB Output is correct
50 Correct 800 ms 460 KB Output is correct
51 Correct 800 ms 452 KB Output is correct
52 Correct 966 ms 592 KB Output is correct
53 Execution timed out 1075 ms 464 KB Time limit exceeded
54 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 472 KB Output is correct
2 Correct 4 ms 460 KB Output is correct
3 Correct 2 ms 460 KB Output is correct
4 Correct 3 ms 476 KB Output is correct
5 Correct 8 ms 472 KB Output is correct
6 Correct 5 ms 460 KB Output is correct
7 Correct 4 ms 460 KB Output is correct
8 Correct 7 ms 460 KB Output is correct
9 Correct 6 ms 472 KB Output is correct
10 Correct 22 ms 476 KB Output is correct
11 Correct 26 ms 476 KB Output is correct
12 Correct 22 ms 472 KB Output is correct
13 Correct 18 ms 460 KB Output is correct
14 Correct 21 ms 456 KB Output is correct
15 Correct 22 ms 468 KB Output is correct
16 Correct 31 ms 460 KB Output is correct
17 Correct 15 ms 480 KB Output is correct
18 Correct 17 ms 460 KB Output is correct
19 Correct 19 ms 476 KB Output is correct
20 Correct 22 ms 460 KB Output is correct
21 Correct 71 ms 464 KB Output is correct
22 Correct 90 ms 460 KB Output is correct
23 Correct 49 ms 464 KB Output is correct
24 Correct 133 ms 468 KB Output is correct
25 Correct 138 ms 460 KB Output is correct
26 Correct 150 ms 460 KB Output is correct
27 Correct 145 ms 464 KB Output is correct
28 Correct 147 ms 460 KB Output is correct
29 Correct 147 ms 460 KB Output is correct
30 Correct 147 ms 460 KB Output is correct
31 Correct 151 ms 460 KB Output is correct
32 Correct 148 ms 464 KB Output is correct
33 Correct 146 ms 460 KB Output is correct
34 Correct 146 ms 460 KB Output is correct
35 Correct 147 ms 460 KB Output is correct
36 Correct 175 ms 460 KB Output is correct
37 Correct 527 ms 452 KB Output is correct
38 Correct 522 ms 460 KB Output is correct
39 Correct 764 ms 460 KB Output is correct
40 Correct 924 ms 460 KB Output is correct
41 Correct 886 ms 580 KB Output is correct
42 Correct 801 ms 460 KB Output is correct
43 Correct 781 ms 708 KB Output is correct
44 Correct 813 ms 596 KB Output is correct
45 Correct 834 ms 588 KB Output is correct
46 Correct 917 ms 468 KB Output is correct
47 Correct 806 ms 460 KB Output is correct
48 Correct 822 ms 460 KB Output is correct
49 Correct 795 ms 464 KB Output is correct
50 Correct 800 ms 460 KB Output is correct
51 Correct 800 ms 452 KB Output is correct
52 Correct 966 ms 592 KB Output is correct
53 Execution timed out 1075 ms 464 KB Time limit exceeded
54 Halted 0 ms 0 KB -