oj.uz

Submission #546206

# Submission time Handle Problem Language Result Execution time Memory
546206 2022-04-06T16:09:18 Z SmolBrain Bootfall (IZhO17_bootfall) C++17
65 / 100
 1000 ms 3244 KB 
// Om Namah Shivaya
// GM in 119 days

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define endl '\n'
#define pb push_back
#define conts continue
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
#define ff first
#define ss second
#define ceil2(x,y) ((x+y-1) / (y))
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#ifndef ONLINE_JUDGE
#define debug(x) cout << #x <<" = "; print(x); cout << endl
#else
#define debug(x)
#endif

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

bool iseven(ll n) {if ((n & 1) == 0) return true; return false;}

void print(ll t) {cout << t;}
void print(int t) {cout << t;}
void print(string t) {cout << t;}
void print(char t) {cout << t;}
void print(double t) {cout << t;}
void print(ld t) {cout << 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(pair <T, V> p) {cout << "{"; print(p.ff); cout << ","; print(p.ss); cout << "}";}
template <class T> void print(vector <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T> void print(set <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T> void print(multiset <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T, class V> void print(map <T, V> v) {cout << "[ "; for (auto i : v) {print(i); cout << " ";} cout << "]";}
template<typename T> void amin(T &a, T b) { a = min(a, b); }
template<typename T> void amax(T &a, T b) { a = max(a, b); }

void usaco(string filename) {
    freopen((filename + ".in").c_str(), "r", stdin);
    freopen((filename + ".out").c_str(), "w", stdout);
}

const int MOD = 1e9 + 7;
const int maxn = 500 * 500 + 5;
const int inf1 = 1e9 + 5;
const ll inf2 = ll(1e18) + 5;

void solve(int test_case)
{
    // thanks to the 1st sol here (Mr.Francois Vogel's sol) for providing me the sol intuition: https://usaco.guide/problem-solutions/
    ll n; cin >> n;
    vector<ll> a(n);
    rep(i, n) cin >> a[i];

    bitset<maxn> b;
    b[0] = 1;

    rep(i, n) {
        b |= (b << a[i]);
    }

    ll sum = accumulate(all(a), 0ll);

    if (sum & 1) {
        cout << 0 << endl;
        return;
    }

    if (b[sum / 2] == 0) {
        cout << 0 << endl;
        return;
    }

    vector<ll> cnt(maxn);

    rep(i, n) {
        bitset<maxn> curr;
        curr[0] = 1;
        sum = 0;

        rep(j, n) {
            if (j == i) conts;

            curr |= (curr << a[j]);
            sum += a[j];
        }

        rep1(j, maxn - 1) {
            // iterating over all possible values for tina
            ll sum2 = sum + j;
            if (sum2 & 1) conts;

            if (curr[sum2 / 2]) {
                cnt[j]++;
            }
            else if (sum2 / 2 - j >= 0) {
                if (curr[sum2 / 2 - j]) {
                    cnt[j]++;
                }
            }
        }
    }

    vector<ll> ans;

    rep1(i, maxn - 1) {
        if (cnt[i] == n) {
            ans.pb(i);
        }
    }

    cout << sz(ans) << endl;
    trav(x, ans) cout << x << " ";
    cout << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;
    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Compilation message

bootfall.cpp: In function 'void usaco(std::string)':
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((filename + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bootfall.cpp:65:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   65 |     freopen((filename + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2388 KB Output is correct
2 Correct 4 ms 2352 KB Output is correct
3 Correct 1 ms 432 KB Output is correct
4 Correct 3 ms 2388 KB Output is correct
5 Correct 7 ms 2388 KB Output is correct
6 Correct 5 ms 2336 KB Output is correct
7 Correct 4 ms 2388 KB Output is correct
8 Correct 7 ms 2388 KB Output is correct
9 Correct 6 ms 2360 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2388 KB Output is correct
2 Correct 4 ms 2352 KB Output is correct
3 Correct 1 ms 432 KB Output is correct
4 Correct 3 ms 2388 KB Output is correct
5 Correct 7 ms 2388 KB Output is correct
6 Correct 5 ms 2336 KB Output is correct
7 Correct 4 ms 2388 KB Output is correct
8 Correct 7 ms 2388 KB Output is correct
9 Correct 6 ms 2360 KB Output is correct
10 Correct 17 ms 2388 KB Output is correct
11 Correct 19 ms 2388 KB Output is correct
12 Correct 21 ms 2388 KB Output is correct
13 Correct 22 ms 2388 KB Output is correct
14 Correct 15 ms 2412 KB Output is correct
15 Correct 17 ms 2388 KB Output is correct
16 Correct 18 ms 2408 KB Output is correct
17 Correct 9 ms 2408 KB Output is correct
18 Correct 13 ms 2388 KB Output is correct
19 Correct 16 ms 2416 KB Output is correct
20 Correct 18 ms 2388 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2388 KB Output is correct
2 Correct 4 ms 2352 KB Output is correct
3 Correct 1 ms 432 KB Output is correct
4 Correct 3 ms 2388 KB Output is correct
5 Correct 7 ms 2388 KB Output is correct
6 Correct 5 ms 2336 KB Output is correct
7 Correct 4 ms 2388 KB Output is correct
8 Correct 7 ms 2388 KB Output is correct
9 Correct 6 ms 2360 KB Output is correct
10 Correct 17 ms 2388 KB Output is correct
11 Correct 19 ms 2388 KB Output is correct
12 Correct 21 ms 2388 KB Output is correct
13 Correct 22 ms 2388 KB Output is correct
14 Correct 15 ms 2412 KB Output is correct
15 Correct 17 ms 2388 KB Output is correct
16 Correct 18 ms 2408 KB Output is correct
17 Correct 9 ms 2408 KB Output is correct
18 Correct 13 ms 2388 KB Output is correct
19 Correct 16 ms 2416 KB Output is correct
20 Correct 18 ms 2388 KB Output is correct
21 Correct 56 ms 2388 KB Output is correct
22 Correct 75 ms 2388 KB Output is correct
23 Correct 36 ms 2400 KB Output is correct
24 Correct 97 ms 2356 KB Output is correct
25 Correct 93 ms 2388 KB Output is correct
26 Correct 112 ms 2388 KB Output is correct
27 Correct 106 ms 2392 KB Output is correct
28 Correct 103 ms 2388 KB Output is correct
29 Correct 109 ms 2392 KB Output is correct
30 Correct 108 ms 2388 KB Output is correct
31 Correct 111 ms 2392 KB Output is correct
32 Correct 102 ms 2392 KB Output is correct
33 Correct 111 ms 2384 KB Output is correct
34 Correct 107 ms 2388 KB Output is correct
35 Correct 105 ms 2392 KB Output is correct
36 Correct 102 ms 2392 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2388 KB Output is correct
2 Correct 4 ms 2352 KB Output is correct
3 Correct 1 ms 432 KB Output is correct
4 Correct 3 ms 2388 KB Output is correct
5 Correct 7 ms 2388 KB Output is correct
6 Correct 5 ms 2336 KB Output is correct
7 Correct 4 ms 2388 KB Output is correct
8 Correct 7 ms 2388 KB Output is correct
9 Correct 6 ms 2360 KB Output is correct
10 Correct 17 ms 2388 KB Output is correct
11 Correct 19 ms 2388 KB Output is correct
12 Correct 21 ms 2388 KB Output is correct
13 Correct 22 ms 2388 KB Output is correct
14 Correct 15 ms 2412 KB Output is correct
15 Correct 17 ms 2388 KB Output is correct
16 Correct 18 ms 2408 KB Output is correct
17 Correct 9 ms 2408 KB Output is correct
18 Correct 13 ms 2388 KB Output is correct
19 Correct 16 ms 2416 KB Output is correct
20 Correct 18 ms 2388 KB Output is correct
21 Correct 56 ms 2388 KB Output is correct
22 Correct 75 ms 2388 KB Output is correct
23 Correct 36 ms 2400 KB Output is correct
24 Correct 97 ms 2356 KB Output is correct
25 Correct 93 ms 2388 KB Output is correct
26 Correct 112 ms 2388 KB Output is correct
27 Correct 106 ms 2392 KB Output is correct
28 Correct 103 ms 2388 KB Output is correct
29 Correct 109 ms 2392 KB Output is correct
30 Correct 108 ms 2388 KB Output is correct
31 Correct 111 ms 2392 KB Output is correct
32 Correct 102 ms 2392 KB Output is correct
33 Correct 111 ms 2384 KB Output is correct
34 Correct 107 ms 2388 KB Output is correct
35 Correct 105 ms 2392 KB Output is correct
36 Correct 102 ms 2392 KB Output is correct
37 Correct 361 ms 2644 KB Output is correct
38 Correct 356 ms 2644 KB Output is correct
39 Correct 519 ms 2400 KB Output is correct
40 Correct 625 ms 2648 KB Output is correct
41 Correct 616 ms 2392 KB Output is correct
42 Correct 545 ms 2644 KB Output is correct
43 Correct 491 ms 2772 KB Output is correct
44 Correct 516 ms 2788 KB Output is correct
45 Correct 522 ms 2772 KB Output is correct
46 Correct 623 ms 2388 KB Output is correct
47 Correct 517 ms 2660 KB Output is correct
48 Correct 533 ms 2912 KB Output is correct
49 Correct 524 ms 2524 KB Output is correct
50 Correct 511 ms 2656 KB Output is correct
51 Correct 3 ms 340 KB Output is correct
52 Correct 637 ms 2904 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2388 KB Output is correct
2 Correct 4 ms 2352 KB Output is correct
3 Correct 1 ms 432 KB Output is correct
4 Correct 3 ms 2388 KB Output is correct
5 Correct 7 ms 2388 KB Output is correct
6 Correct 5 ms 2336 KB Output is correct
7 Correct 4 ms 2388 KB Output is correct
8 Correct 7 ms 2388 KB Output is correct
9 Correct 6 ms 2360 KB Output is correct
10 Correct 17 ms 2388 KB Output is correct
11 Correct 19 ms 2388 KB Output is correct
12 Correct 21 ms 2388 KB Output is correct
13 Correct 22 ms 2388 KB Output is correct
14 Correct 15 ms 2412 KB Output is correct
15 Correct 17 ms 2388 KB Output is correct
16 Correct 18 ms 2408 KB Output is correct
17 Correct 9 ms 2408 KB Output is correct
18 Correct 13 ms 2388 KB Output is correct
19 Correct 16 ms 2416 KB Output is correct
20 Correct 18 ms 2388 KB Output is correct
21 Correct 56 ms 2388 KB Output is correct
22 Correct 75 ms 2388 KB Output is correct
23 Correct 36 ms 2400 KB Output is correct
24 Correct 97 ms 2356 KB Output is correct
25 Correct 93 ms 2388 KB Output is correct
26 Correct 112 ms 2388 KB Output is correct
27 Correct 106 ms 2392 KB Output is correct
28 Correct 103 ms 2388 KB Output is correct
29 Correct 109 ms 2392 KB Output is correct
30 Correct 108 ms 2388 KB Output is correct
31 Correct 111 ms 2392 KB Output is correct
32 Correct 102 ms 2392 KB Output is correct
33 Correct 111 ms 2384 KB Output is correct
34 Correct 107 ms 2388 KB Output is correct
35 Correct 105 ms 2392 KB Output is correct
36 Correct 102 ms 2392 KB Output is correct
37 Correct 361 ms 2644 KB Output is correct
38 Correct 356 ms 2644 KB Output is correct
39 Correct 519 ms 2400 KB Output is correct
40 Correct 625 ms 2648 KB Output is correct
41 Correct 616 ms 2392 KB Output is correct
42 Correct 545 ms 2644 KB Output is correct
43 Correct 491 ms 2772 KB Output is correct
44 Correct 516 ms 2788 KB Output is correct
45 Correct 522 ms 2772 KB Output is correct
46 Correct 623 ms 2388 KB Output is correct
47 Correct 517 ms 2660 KB Output is correct
48 Correct 533 ms 2912 KB Output is correct
49 Correct 524 ms 2524 KB Output is correct
50 Correct 511 ms 2656 KB Output is correct
51 Correct 3 ms 340 KB Output is correct
52 Correct 637 ms 2904 KB Output is correct
53 Correct 725 ms 2776 KB Output is correct
54 Correct 966 ms 2792 KB Output is correct
55 Correct 950 ms 3168 KB Output is correct
56 Correct 747 ms 2776 KB Output is correct
57 Correct 971 ms 3172 KB Output is correct
58 Correct 951 ms 2920 KB Output is correct
59 Correct 965 ms 3036 KB Output is correct
60 Correct 3 ms 340 KB Output is correct
61 Correct 975 ms 3032 KB Output is correct
62 Correct 806 ms 3160 KB Output is correct
63 Correct 848 ms 3172 KB Output is correct
64 Correct 792 ms 3244 KB Output is correct
65 Correct 801 ms 2404 KB Output is correct
66 Correct 754 ms 2636 KB Output is correct

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2388 KB Output is correct
2 Correct 4 ms 2352 KB Output is correct
3 Correct 1 ms 432 KB Output is correct
4 Correct 3 ms 2388 KB Output is correct
5 Correct 7 ms 2388 KB Output is correct
6 Correct 5 ms 2336 KB Output is correct
7 Correct 4 ms 2388 KB Output is correct
8 Correct 7 ms 2388 KB Output is correct
9 Correct 6 ms 2360 KB Output is correct
10 Correct 17 ms 2388 KB Output is correct
11 Correct 19 ms 2388 KB Output is correct
12 Correct 21 ms 2388 KB Output is correct
13 Correct 22 ms 2388 KB Output is correct
14 Correct 15 ms 2412 KB Output is correct
15 Correct 17 ms 2388 KB Output is correct
16 Correct 18 ms 2408 KB Output is correct
17 Correct 9 ms 2408 KB Output is correct
18 Correct 13 ms 2388 KB Output is correct
19 Correct 16 ms 2416 KB Output is correct
20 Correct 18 ms 2388 KB Output is correct
21 Correct 56 ms 2388 KB Output is correct
22 Correct 75 ms 2388 KB Output is correct
23 Correct 36 ms 2400 KB Output is correct
24 Correct 97 ms 2356 KB Output is correct
25 Correct 93 ms 2388 KB Output is correct
26 Correct 112 ms 2388 KB Output is correct
27 Correct 106 ms 2392 KB Output is correct
28 Correct 103 ms 2388 KB Output is correct
29 Correct 109 ms 2392 KB Output is correct
30 Correct 108 ms 2388 KB Output is correct
31 Correct 111 ms 2392 KB Output is correct
32 Correct 102 ms 2392 KB Output is correct
33 Correct 111 ms 2384 KB Output is correct
34 Correct 107 ms 2388 KB Output is correct
35 Correct 105 ms 2392 KB Output is correct
36 Correct 102 ms 2392 KB Output is correct
37 Correct 361 ms 2644 KB Output is correct
38 Correct 356 ms 2644 KB Output is correct
39 Correct 519 ms 2400 KB Output is correct
40 Correct 625 ms 2648 KB Output is correct
41 Correct 616 ms 2392 KB Output is correct
42 Correct 545 ms 2644 KB Output is correct
43 Correct 491 ms 2772 KB Output is correct
44 Correct 516 ms 2788 KB Output is correct
45 Correct 522 ms 2772 KB Output is correct
46 Correct 623 ms 2388 KB Output is correct
47 Correct 517 ms 2660 KB Output is correct
48 Correct 533 ms 2912 KB Output is correct
49 Correct 524 ms 2524 KB Output is correct
50 Correct 511 ms 2656 KB Output is correct
51 Correct 3 ms 340 KB Output is correct
52 Correct 637 ms 2904 KB Output is correct
53 Correct 725 ms 2776 KB Output is correct
54 Correct 966 ms 2792 KB Output is correct
55 Correct 950 ms 3168 KB Output is correct
56 Correct 747 ms 2776 KB Output is correct
57 Correct 971 ms 3172 KB Output is correct
58 Correct 951 ms 2920 KB Output is correct
59 Correct 965 ms 3036 KB Output is correct
60 Correct 3 ms 340 KB Output is correct
61 Correct 975 ms 3032 KB Output is correct
62 Correct 806 ms 3160 KB Output is correct
63 Correct 848 ms 3172 KB Output is correct
64 Correct 792 ms 3244 KB Output is correct
65 Correct 801 ms 2404 KB Output is correct
66 Correct 754 ms 2636 KB Output is correct
67 Execution timed out 1088 ms 2388 KB Time limit exceeded
68 Halted 0 ms 0 KB -