oj.uz

답안 #546214

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
546214 2022-04-06T16:26:05 Z SmolBrain Bootfall (IZhO17_bootfall) C++17
100 / 100
 725 ms 33268 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 + 1;
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/
    int n; cin >> n;
    vector<int> a(n);
    rep(i, n) cin >> a[i];

    bitset<maxn> pref[n], suff[n];
    bitset<maxn> b;
    b[0] = 1;

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

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

    rev(i, n - 1, 0) {
        b |= (b << a[i]);
        suff[i] = b;
    }

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

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

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

    vector<int> cnt(maxn);

    rep(i, n) {
        bitset<maxn> curr;

        if (i < n / 2) {
            curr = suff[i + 1];
            rep(j, i) curr |= (curr << a[j]);
        }
        else {
            curr = pref[i - 1];
            for (int j = i + 1; j < n; ++j) curr |= (curr << a[j]);
        }

        sum = 0;

        rep(j, n) {
            if (i != j) {
                sum += a[j];
            }
        }

        rep1(j, maxn - 1) {
            // iterating over all possible values for tina
            int 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<int> 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

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1620 KB Output is correct
2 Correct 5 ms 1708 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 3 ms 1620 KB Output is correct
5 Correct 8 ms 2132 KB Output is correct
6 Correct 6 ms 1876 KB Output is correct
7 Correct 4 ms 1748 KB Output is correct
8 Correct 6 ms 2132 KB Output is correct
9 Correct 5 ms 2004 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1620 KB Output is correct
2 Correct 5 ms 1708 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 3 ms 1620 KB Output is correct
5 Correct 8 ms 2132 KB Output is correct
6 Correct 6 ms 1876 KB Output is correct
7 Correct 4 ms 1748 KB Output is correct
8 Correct 6 ms 2132 KB Output is correct
9 Correct 5 ms 2004 KB Output is correct
10 Correct 14 ms 3156 KB Output is correct
11 Correct 14 ms 3156 KB Output is correct
12 Correct 13 ms 3156 KB Output is correct
13 Correct 12 ms 2900 KB Output is correct
14 Correct 14 ms 3028 KB Output is correct
15 Correct 16 ms 3028 KB Output is correct
16 Correct 18 ms 3156 KB Output is correct
17 Correct 9 ms 2516 KB Output is correct
18 Correct 14 ms 2772 KB Output is correct
19 Correct 12 ms 2900 KB Output is correct
20 Correct 16 ms 3156 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1620 KB Output is correct
2 Correct 5 ms 1708 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 3 ms 1620 KB Output is correct
5 Correct 8 ms 2132 KB Output is correct
6 Correct 6 ms 1876 KB Output is correct
7 Correct 4 ms 1748 KB Output is correct
8 Correct 6 ms 2132 KB Output is correct
9 Correct 5 ms 2004 KB Output is correct
10 Correct 14 ms 3156 KB Output is correct
11 Correct 14 ms 3156 KB Output is correct
12 Correct 13 ms 3156 KB Output is correct
13 Correct 12 ms 2900 KB Output is correct
14 Correct 14 ms 3028 KB Output is correct
15 Correct 16 ms 3028 KB Output is correct
16 Correct 18 ms 3156 KB Output is correct
17 Correct 9 ms 2516 KB Output is correct
18 Correct 14 ms 2772 KB Output is correct
19 Correct 12 ms 2900 KB Output is correct
20 Correct 16 ms 3156 KB Output is correct
21 Correct 32 ms 5336 KB Output is correct
22 Correct 36 ms 5932 KB Output is correct
23 Correct 24 ms 4488 KB Output is correct
24 Correct 52 ms 7164 KB Output is correct
25 Correct 54 ms 7152 KB Output is correct
26 Correct 62 ms 7532 KB Output is correct
27 Correct 60 ms 7540 KB Output is correct
28 Correct 53 ms 7540 KB Output is correct
29 Correct 57 ms 7508 KB Output is correct
30 Correct 67 ms 7504 KB Output is correct
31 Correct 59 ms 7536 KB Output is correct
32 Correct 53 ms 7540 KB Output is correct
33 Correct 55 ms 7448 KB Output is correct
34 Correct 55 ms 7444 KB Output is correct
35 Correct 57 ms 7508 KB Output is correct
36 Correct 63 ms 7632 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1620 KB Output is correct
2 Correct 5 ms 1708 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 3 ms 1620 KB Output is correct
5 Correct 8 ms 2132 KB Output is correct
6 Correct 6 ms 1876 KB Output is correct
7 Correct 4 ms 1748 KB Output is correct
8 Correct 6 ms 2132 KB Output is correct
9 Correct 5 ms 2004 KB Output is correct
10 Correct 14 ms 3156 KB Output is correct
11 Correct 14 ms 3156 KB Output is correct
12 Correct 13 ms 3156 KB Output is correct
13 Correct 12 ms 2900 KB Output is correct
14 Correct 14 ms 3028 KB Output is correct
15 Correct 16 ms 3028 KB Output is correct
16 Correct 18 ms 3156 KB Output is correct
17 Correct 9 ms 2516 KB Output is correct
18 Correct 14 ms 2772 KB Output is correct
19 Correct 12 ms 2900 KB Output is correct
20 Correct 16 ms 3156 KB Output is correct
21 Correct 32 ms 5336 KB Output is correct
22 Correct 36 ms 5932 KB Output is correct
23 Correct 24 ms 4488 KB Output is correct
24 Correct 52 ms 7164 KB Output is correct
25 Correct 54 ms 7152 KB Output is correct
26 Correct 62 ms 7532 KB Output is correct
27 Correct 60 ms 7540 KB Output is correct
28 Correct 53 ms 7540 KB Output is correct
29 Correct 57 ms 7508 KB Output is correct
30 Correct 67 ms 7504 KB Output is correct
31 Correct 59 ms 7536 KB Output is correct
32 Correct 53 ms 7540 KB Output is correct
33 Correct 55 ms 7448 KB Output is correct
34 Correct 55 ms 7444 KB Output is correct
35 Correct 57 ms 7508 KB Output is correct
36 Correct 63 ms 7632 KB Output is correct
37 Correct 148 ms 13772 KB Output is correct
38 Correct 146 ms 13768 KB Output is correct
39 Correct 197 ms 16576 KB Output is correct
40 Correct 247 ms 18048 KB Output is correct
41 Correct 221 ms 17836 KB Output is correct
42 Correct 231 ms 16840 KB Output is correct
43 Correct 189 ms 16716 KB Output is correct
44 Correct 213 ms 16960 KB Output is correct
45 Correct 191 ms 17084 KB Output is correct
46 Correct 220 ms 17876 KB Output is correct
47 Correct 202 ms 16864 KB Output is correct
48 Correct 203 ms 17004 KB Output is correct
49 Correct 221 ms 16716 KB Output is correct
50 Correct 200 ms 16832 KB Output is correct
51 Correct 12 ms 15700 KB Output is correct
52 Correct 238 ms 18320 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1620 KB Output is correct
2 Correct 5 ms 1708 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 3 ms 1620 KB Output is correct
5 Correct 8 ms 2132 KB Output is correct
6 Correct 6 ms 1876 KB Output is correct
7 Correct 4 ms 1748 KB Output is correct
8 Correct 6 ms 2132 KB Output is correct
9 Correct 5 ms 2004 KB Output is correct
10 Correct 14 ms 3156 KB Output is correct
11 Correct 14 ms 3156 KB Output is correct
12 Correct 13 ms 3156 KB Output is correct
13 Correct 12 ms 2900 KB Output is correct
14 Correct 14 ms 3028 KB Output is correct
15 Correct 16 ms 3028 KB Output is correct
16 Correct 18 ms 3156 KB Output is correct
17 Correct 9 ms 2516 KB Output is correct
18 Correct 14 ms 2772 KB Output is correct
19 Correct 12 ms 2900 KB Output is correct
20 Correct 16 ms 3156 KB Output is correct
21 Correct 32 ms 5336 KB Output is correct
22 Correct 36 ms 5932 KB Output is correct
23 Correct 24 ms 4488 KB Output is correct
24 Correct 52 ms 7164 KB Output is correct
25 Correct 54 ms 7152 KB Output is correct
26 Correct 62 ms 7532 KB Output is correct
27 Correct 60 ms 7540 KB Output is correct
28 Correct 53 ms 7540 KB Output is correct
29 Correct 57 ms 7508 KB Output is correct
30 Correct 67 ms 7504 KB Output is correct
31 Correct 59 ms 7536 KB Output is correct
32 Correct 53 ms 7540 KB Output is correct
33 Correct 55 ms 7448 KB Output is correct
34 Correct 55 ms 7444 KB Output is correct
35 Correct 57 ms 7508 KB Output is correct
36 Correct 63 ms 7632 KB Output is correct
37 Correct 148 ms 13772 KB Output is correct
38 Correct 146 ms 13768 KB Output is correct
39 Correct 197 ms 16576 KB Output is correct
40 Correct 247 ms 18048 KB Output is correct
41 Correct 221 ms 17836 KB Output is correct
42 Correct 231 ms 16840 KB Output is correct
43 Correct 189 ms 16716 KB Output is correct
44 Correct 213 ms 16960 KB Output is correct
45 Correct 191 ms 17084 KB Output is correct
46 Correct 220 ms 17876 KB Output is correct
47 Correct 202 ms 16864 KB Output is correct
48 Correct 203 ms 17004 KB Output is correct
49 Correct 221 ms 16716 KB Output is correct
50 Correct 200 ms 16832 KB Output is correct
51 Correct 12 ms 15700 KB Output is correct
52 Correct 238 ms 18320 KB Output is correct
53 Correct 268 ms 20020 KB Output is correct
54 Correct 368 ms 23196 KB Output is correct
55 Correct 374 ms 23332 KB Output is correct
56 Correct 298 ms 20428 KB Output is correct
57 Correct 342 ms 23348 KB Output is correct
58 Correct 360 ms 23212 KB Output is correct
59 Correct 350 ms 23196 KB Output is correct
60 Correct 19 ms 21804 KB Output is correct
61 Correct 385 ms 23336 KB Output is correct
62 Correct 318 ms 21500 KB Output is correct
63 Correct 329 ms 21584 KB Output is correct
64 Correct 322 ms 21132 KB Output is correct
65 Correct 365 ms 20736 KB Output is correct
66 Correct 320 ms 20376 KB Output is correct

Subtask #6
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1620 KB Output is correct
2 Correct 5 ms 1708 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 3 ms 1620 KB Output is correct
5 Correct 8 ms 2132 KB Output is correct
6 Correct 6 ms 1876 KB Output is correct
7 Correct 4 ms 1748 KB Output is correct
8 Correct 6 ms 2132 KB Output is correct
9 Correct 5 ms 2004 KB Output is correct
10 Correct 14 ms 3156 KB Output is correct
11 Correct 14 ms 3156 KB Output is correct
12 Correct 13 ms 3156 KB Output is correct
13 Correct 12 ms 2900 KB Output is correct
14 Correct 14 ms 3028 KB Output is correct
15 Correct 16 ms 3028 KB Output is correct
16 Correct 18 ms 3156 KB Output is correct
17 Correct 9 ms 2516 KB Output is correct
18 Correct 14 ms 2772 KB Output is correct
19 Correct 12 ms 2900 KB Output is correct
20 Correct 16 ms 3156 KB Output is correct
21 Correct 32 ms 5336 KB Output is correct
22 Correct 36 ms 5932 KB Output is correct
23 Correct 24 ms 4488 KB Output is correct
24 Correct 52 ms 7164 KB Output is correct
25 Correct 54 ms 7152 KB Output is correct
26 Correct 62 ms 7532 KB Output is correct
27 Correct 60 ms 7540 KB Output is correct
28 Correct 53 ms 7540 KB Output is correct
29 Correct 57 ms 7508 KB Output is correct
30 Correct 67 ms 7504 KB Output is correct
31 Correct 59 ms 7536 KB Output is correct
32 Correct 53 ms 7540 KB Output is correct
33 Correct 55 ms 7448 KB Output is correct
34 Correct 55 ms 7444 KB Output is correct
35 Correct 57 ms 7508 KB Output is correct
36 Correct 63 ms 7632 KB Output is correct
37 Correct 148 ms 13772 KB Output is correct
38 Correct 146 ms 13768 KB Output is correct
39 Correct 197 ms 16576 KB Output is correct
40 Correct 247 ms 18048 KB Output is correct
41 Correct 221 ms 17836 KB Output is correct
42 Correct 231 ms 16840 KB Output is correct
43 Correct 189 ms 16716 KB Output is correct
44 Correct 213 ms 16960 KB Output is correct
45 Correct 191 ms 17084 KB Output is correct
46 Correct 220 ms 17876 KB Output is correct
47 Correct 202 ms 16864 KB Output is correct
48 Correct 203 ms 17004 KB Output is correct
49 Correct 221 ms 16716 KB Output is correct
50 Correct 200 ms 16832 KB Output is correct
51 Correct 12 ms 15700 KB Output is correct
52 Correct 238 ms 18320 KB Output is correct
53 Correct 268 ms 20020 KB Output is correct
54 Correct 368 ms 23196 KB Output is correct
55 Correct 374 ms 23332 KB Output is correct
56 Correct 298 ms 20428 KB Output is correct
57 Correct 342 ms 23348 KB Output is correct
58 Correct 360 ms 23212 KB Output is correct
59 Correct 350 ms 23196 KB Output is correct
60 Correct 19 ms 21804 KB Output is correct
61 Correct 385 ms 23336 KB Output is correct
62 Correct 318 ms 21500 KB Output is correct
63 Correct 329 ms 21584 KB Output is correct
64 Correct 322 ms 21132 KB Output is correct
65 Correct 365 ms 20736 KB Output is correct
66 Correct 320 ms 20376 KB Output is correct
67 Correct 454 ms 26392 KB Output is correct
68 Correct 31 ms 30932 KB Output is correct
69 Correct 663 ms 33144 KB Output is correct
70 Correct 714 ms 32756 KB Output is correct
71 Correct 652 ms 32640 KB Output is correct
72 Correct 667 ms 31892 KB Output is correct
73 Correct 684 ms 31880 KB Output is correct
74 Correct 725 ms 33028 KB Output is correct
75 Correct 688 ms 32840 KB Output is correct
76 Correct 637 ms 33148 KB Output is correct
77 Correct 624 ms 33268 KB Output is correct