oj.uz

Submission #572643

# Submission time Handle Problem Language Result Execution time Memory
572643 2022-06-04T21:47:53 Z Sam_a17 Bootfall (IZhO17_bootfall) C++14
100 / 100
 314 ms 7000 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;

#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif

#define sz(x) (int((x).size()))
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
#define blt __builtin_popcount

#define pb push_back
#define popf pop_front
#define popb pop_back

void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}

template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}

#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'

// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};

// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
  fastIO();

  if (str != "") {
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "w", stdout);
  }
}
// Indexed Set
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const long long M = 501, N = M * M, mod = 1e9 + 7;
long long n, dp[N], answ[N], used[N];

void add(int value, int s) {
  for(int i = s - value; i >= 0; i--) {
    if(dp[i]) {
      dp[i + value] += dp[i];
//      dp[i + value] %= mod;
    }
  }
}

void remove(int value, int s) {
  for(int j = value; j <= s; j++) {
    if(dp[j]) {
      dp[j] -= dp[j - value];
//      if(dp[j] < 0) {
//        dp[j] += mod;
//      }
    }
  }
}

void solve_() {
  cin >> n;

  vector<int> a(n);
  int s = 0; dp[0] = 1;
  for(int i = 0; i < n; i++) {
    cin >> a[i], s += a[i];
    add(a[i], s);
  }

  if(s % 2 == 1 || !dp[s / 2]) {
    printf("0\n");
    return;
  }

  vector<int> answer;
  for(int i = 0; i < n; i++) {
    remove(a[i], s), s -= a[i];
    for(int j = 0; j <= s / 2; j++) {
      if(dp[j]) {
        // j
        // s - j
        answ[s - 2 * j]++;
        if( (s - 2 * j) > 0 && answ[s - 2 * j] == n && !used[s - 2 * j]) {
          used[s - 2 * j] = true, answer.push_back(s - 2 * j);
        }
      }
    }
    s += a[i], add(a[i], s);
  }

  printf("%d\n", sz(answer));
  sort(all(answer));
  for(auto i: answer) {
    printf("%d ", i);
  } printf("\n");
}

int main() {
  setIO();

  auto solve = [&](int test_case)-> void {
    while(test_case--) {
      solve_();
    }
  };

  int test_cases = 1;
  solve(test_cases);

  return 0;
}

Compilation message

bootfall.cpp: In function 'void setIO(std::string)':
bootfall.cpp:63:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   63 |     freopen((str + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bootfall.cpp:64:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   64 |     freopen((str + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 2 ms 468 KB Output is correct
25 Correct 4 ms 468 KB Output is correct
26 Correct 4 ms 468 KB Output is correct
27 Correct 3 ms 468 KB Output is correct
28 Correct 3 ms 468 KB Output is correct
29 Correct 4 ms 468 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 2 ms 468 KB Output is correct
32 Correct 2 ms 468 KB Output is correct
33 Correct 3 ms 468 KB Output is correct
34 Correct 3 ms 468 KB Output is correct
35 Correct 4 ms 492 KB Output is correct
36 Correct 2 ms 468 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 2 ms 468 KB Output is correct
25 Correct 4 ms 468 KB Output is correct
26 Correct 4 ms 468 KB Output is correct
27 Correct 3 ms 468 KB Output is correct
28 Correct 3 ms 468 KB Output is correct
29 Correct 4 ms 468 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 2 ms 468 KB Output is correct
32 Correct 2 ms 468 KB Output is correct
33 Correct 3 ms 468 KB Output is correct
34 Correct 3 ms 468 KB Output is correct
35 Correct 4 ms 492 KB Output is correct
36 Correct 2 ms 468 KB Output is correct
37 Correct 10 ms 852 KB Output is correct
38 Correct 11 ms 852 KB Output is correct
39 Correct 40 ms 1740 KB Output is correct
40 Correct 23 ms 1228 KB Output is correct
41 Correct 60 ms 1948 KB Output is correct
42 Correct 18 ms 1200 KB Output is correct
43 Correct 33 ms 1876 KB Output is correct
44 Correct 34 ms 1896 KB Output is correct
45 Correct 34 ms 1972 KB Output is correct
46 Correct 24 ms 852 KB Output is correct
47 Correct 21 ms 1240 KB Output is correct
48 Correct 48 ms 1868 KB Output is correct
49 Correct 43 ms 1544 KB Output is correct
50 Correct 20 ms 1232 KB Output is correct
51 Correct 4 ms 468 KB Output is correct
52 Correct 46 ms 2192 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 2 ms 468 KB Output is correct
25 Correct 4 ms 468 KB Output is correct
26 Correct 4 ms 468 KB Output is correct
27 Correct 3 ms 468 KB Output is correct
28 Correct 3 ms 468 KB Output is correct
29 Correct 4 ms 468 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 2 ms 468 KB Output is correct
32 Correct 2 ms 468 KB Output is correct
33 Correct 3 ms 468 KB Output is correct
34 Correct 3 ms 468 KB Output is correct
35 Correct 4 ms 492 KB Output is correct
36 Correct 2 ms 468 KB Output is correct
37 Correct 10 ms 852 KB Output is correct
38 Correct 11 ms 852 KB Output is correct
39 Correct 40 ms 1740 KB Output is correct
40 Correct 23 ms 1228 KB Output is correct
41 Correct 60 ms 1948 KB Output is correct
42 Correct 18 ms 1200 KB Output is correct
43 Correct 33 ms 1876 KB Output is correct
44 Correct 34 ms 1896 KB Output is correct
45 Correct 34 ms 1972 KB Output is correct
46 Correct 24 ms 852 KB Output is correct
47 Correct 21 ms 1240 KB Output is correct
48 Correct 48 ms 1868 KB Output is correct
49 Correct 43 ms 1544 KB Output is correct
50 Correct 20 ms 1232 KB Output is correct
51 Correct 4 ms 468 KB Output is correct
52 Correct 46 ms 2192 KB Output is correct
53 Correct 34 ms 1680 KB Output is correct
54 Correct 53 ms 1968 KB Output is correct
55 Correct 100 ms 3512 KB Output is correct
56 Correct 45 ms 1956 KB Output is correct
57 Correct 102 ms 3564 KB Output is correct
58 Correct 54 ms 2124 KB Output is correct
59 Correct 65 ms 2544 KB Output is correct
60 Correct 9 ms 724 KB Output is correct
61 Correct 75 ms 2824 KB Output is correct
62 Correct 79 ms 3108 KB Output is correct
63 Correct 88 ms 3240 KB Output is correct
64 Correct 77 ms 3280 KB Output is correct
65 Correct 50 ms 1468 KB Output is correct
66 Correct 38 ms 1548 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 2 ms 468 KB Output is correct
25 Correct 4 ms 468 KB Output is correct
26 Correct 4 ms 468 KB Output is correct
27 Correct 3 ms 468 KB Output is correct
28 Correct 3 ms 468 KB Output is correct
29 Correct 4 ms 468 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 2 ms 468 KB Output is correct
32 Correct 2 ms 468 KB Output is correct
33 Correct 3 ms 468 KB Output is correct
34 Correct 3 ms 468 KB Output is correct
35 Correct 4 ms 492 KB Output is correct
36 Correct 2 ms 468 KB Output is correct
37 Correct 10 ms 852 KB Output is correct
38 Correct 11 ms 852 KB Output is correct
39 Correct 40 ms 1740 KB Output is correct
40 Correct 23 ms 1228 KB Output is correct
41 Correct 60 ms 1948 KB Output is correct
42 Correct 18 ms 1200 KB Output is correct
43 Correct 33 ms 1876 KB Output is correct
44 Correct 34 ms 1896 KB Output is correct
45 Correct 34 ms 1972 KB Output is correct
46 Correct 24 ms 852 KB Output is correct
47 Correct 21 ms 1240 KB Output is correct
48 Correct 48 ms 1868 KB Output is correct
49 Correct 43 ms 1544 KB Output is correct
50 Correct 20 ms 1232 KB Output is correct
51 Correct 4 ms 468 KB Output is correct
52 Correct 46 ms 2192 KB Output is correct
53 Correct 34 ms 1680 KB Output is correct
54 Correct 53 ms 1968 KB Output is correct
55 Correct 100 ms 3512 KB Output is correct
56 Correct 45 ms 1956 KB Output is correct
57 Correct 102 ms 3564 KB Output is correct
58 Correct 54 ms 2124 KB Output is correct
59 Correct 65 ms 2544 KB Output is correct
60 Correct 9 ms 724 KB Output is correct
61 Correct 75 ms 2824 KB Output is correct
62 Correct 79 ms 3108 KB Output is correct
63 Correct 88 ms 3240 KB Output is correct
64 Correct 77 ms 3280 KB Output is correct
65 Correct 50 ms 1468 KB Output is correct
66 Correct 38 ms 1548 KB Output is correct
67 Correct 81 ms 2600 KB Output is correct
68 Correct 24 ms 1236 KB Output is correct
69 Correct 266 ms 6352 KB Output is correct
70 Correct 189 ms 3988 KB Output is correct
71 Correct 156 ms 3928 KB Output is correct
72 Correct 149 ms 2252 KB Output is correct
73 Correct 144 ms 2280 KB Output is correct
74 Correct 284 ms 6808 KB Output is correct
75 Correct 197 ms 5340 KB Output is correct
76 Correct 314 ms 6936 KB Output is correct
77 Correct 292 ms 7000 KB Output is correct