oj.uz

Submission #572635

# Submission time Handle Problem Language Result Execution time Memory
572635 2022-06-04T21:37:03 Z Sam_a17 Bootfall (IZhO17_bootfall) C++14
28 / 100
 58 ms 1656 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 = 251, N = M * M, mod = 1e9 + 7;
long long n, dp[N], answ[N], used[N];

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

void remove(int value) {
  for(int j = value; j < N; 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]);
  }

  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 -= a[i];
    for(int j = 0; j <= s / 2; j++) {
      if(dp[j]) {
        // j
        // s - j
        answ[s - 2 * j]++;
        if(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]);
  }

  printf("%d\n", sz(answer));
  reverse(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 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 3 ms 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct

Subtask #2
7.0 / 7.0

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

Subtask #3
15.0 / 15.0

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

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 3 ms 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 5 ms 340 KB Output is correct
11 Correct 5 ms 340 KB Output is correct
12 Correct 5 ms 340 KB Output is correct
13 Correct 4 ms 212 KB Output is correct
14 Correct 4 ms 340 KB Output is correct
15 Correct 4 ms 212 KB Output is correct
16 Correct 4 ms 212 KB Output is correct
17 Correct 3 ms 212 KB Output is correct
18 Correct 4 ms 212 KB Output is correct
19 Correct 7 ms 328 KB Output is correct
20 Correct 4 ms 340 KB Output is correct
21 Correct 9 ms 376 KB Output is correct
22 Correct 10 ms 340 KB Output is correct
23 Correct 10 ms 468 KB Output is correct
24 Correct 17 ms 476 KB Output is correct
25 Correct 15 ms 472 KB Output is correct
26 Correct 15 ms 468 KB Output is correct
27 Correct 14 ms 468 KB Output is correct
28 Correct 15 ms 468 KB Output is correct
29 Correct 15 ms 488 KB Output is correct
30 Correct 15 ms 368 KB Output is correct
31 Correct 16 ms 452 KB Output is correct
32 Correct 15 ms 408 KB Output is correct
33 Correct 14 ms 468 KB Output is correct
34 Correct 14 ms 484 KB Output is correct
35 Correct 15 ms 480 KB Output is correct
36 Correct 15 ms 408 KB Output is correct
37 Correct 37 ms 872 KB Output is correct
38 Correct 36 ms 844 KB Output is correct
39 Correct 38 ms 1656 KB Output is correct
40 Correct 58 ms 1192 KB Output is correct
41 Incorrect 42 ms 1652 KB Output isn't correct
42 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 3 ms 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 5 ms 340 KB Output is correct
11 Correct 5 ms 340 KB Output is correct
12 Correct 5 ms 340 KB Output is correct
13 Correct 4 ms 212 KB Output is correct
14 Correct 4 ms 340 KB Output is correct
15 Correct 4 ms 212 KB Output is correct
16 Correct 4 ms 212 KB Output is correct
17 Correct 3 ms 212 KB Output is correct
18 Correct 4 ms 212 KB Output is correct
19 Correct 7 ms 328 KB Output is correct
20 Correct 4 ms 340 KB Output is correct
21 Correct 9 ms 376 KB Output is correct
22 Correct 10 ms 340 KB Output is correct
23 Correct 10 ms 468 KB Output is correct
24 Correct 17 ms 476 KB Output is correct
25 Correct 15 ms 472 KB Output is correct
26 Correct 15 ms 468 KB Output is correct
27 Correct 14 ms 468 KB Output is correct
28 Correct 15 ms 468 KB Output is correct
29 Correct 15 ms 488 KB Output is correct
30 Correct 15 ms 368 KB Output is correct
31 Correct 16 ms 452 KB Output is correct
32 Correct 15 ms 408 KB Output is correct
33 Correct 14 ms 468 KB Output is correct
34 Correct 14 ms 484 KB Output is correct
35 Correct 15 ms 480 KB Output is correct
36 Correct 15 ms 408 KB Output is correct
37 Correct 37 ms 872 KB Output is correct
38 Correct 36 ms 844 KB Output is correct
39 Correct 38 ms 1656 KB Output is correct
40 Correct 58 ms 1192 KB Output is correct
41 Incorrect 42 ms 1652 KB Output isn't correct
42 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 3 ms 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 5 ms 340 KB Output is correct
11 Correct 5 ms 340 KB Output is correct
12 Correct 5 ms 340 KB Output is correct
13 Correct 4 ms 212 KB Output is correct
14 Correct 4 ms 340 KB Output is correct
15 Correct 4 ms 212 KB Output is correct
16 Correct 4 ms 212 KB Output is correct
17 Correct 3 ms 212 KB Output is correct
18 Correct 4 ms 212 KB Output is correct
19 Correct 7 ms 328 KB Output is correct
20 Correct 4 ms 340 KB Output is correct
21 Correct 9 ms 376 KB Output is correct
22 Correct 10 ms 340 KB Output is correct
23 Correct 10 ms 468 KB Output is correct
24 Correct 17 ms 476 KB Output is correct
25 Correct 15 ms 472 KB Output is correct
26 Correct 15 ms 468 KB Output is correct
27 Correct 14 ms 468 KB Output is correct
28 Correct 15 ms 468 KB Output is correct
29 Correct 15 ms 488 KB Output is correct
30 Correct 15 ms 368 KB Output is correct
31 Correct 16 ms 452 KB Output is correct
32 Correct 15 ms 408 KB Output is correct
33 Correct 14 ms 468 KB Output is correct
34 Correct 14 ms 484 KB Output is correct
35 Correct 15 ms 480 KB Output is correct
36 Correct 15 ms 408 KB Output is correct
37 Correct 37 ms 872 KB Output is correct
38 Correct 36 ms 844 KB Output is correct
39 Correct 38 ms 1656 KB Output is correct
40 Correct 58 ms 1192 KB Output is correct
41 Incorrect 42 ms 1652 KB Output isn't correct
42 Halted 0 ms 0 KB -