oj.uz

답안 #546207

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
546207 2022-04-06T16:12:19 Z SmolBrain Bootfall (IZhO17_bootfall) C++17
44 / 100
 1000 ms 2056 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> b;
    b[0] = 1;

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

    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;
        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
            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 4 ms 1364 KB Output is correct
2 Correct 5 ms 1364 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 4 ms 1312 KB Output is correct
5 Correct 8 ms 1364 KB Output is correct
6 Correct 6 ms 1364 KB Output is correct
7 Correct 6 ms 1364 KB Output is correct
8 Correct 10 ms 1364 KB Output is correct
9 Correct 7 ms 1364 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 1364 KB Output is correct
2 Correct 5 ms 1364 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 4 ms 1312 KB Output is correct
5 Correct 8 ms 1364 KB Output is correct
6 Correct 6 ms 1364 KB Output is correct
7 Correct 6 ms 1364 KB Output is correct
8 Correct 10 ms 1364 KB Output is correct
9 Correct 7 ms 1364 KB Output is correct
10 Correct 20 ms 1364 KB Output is correct
11 Correct 21 ms 1364 KB Output is correct
12 Correct 28 ms 1364 KB Output is correct
13 Correct 19 ms 1364 KB Output is correct
14 Correct 19 ms 1424 KB Output is correct
15 Correct 18 ms 1364 KB Output is correct
16 Correct 21 ms 1364 KB Output is correct
17 Correct 11 ms 1364 KB Output is correct
18 Correct 17 ms 1364 KB Output is correct
19 Correct 17 ms 1364 KB Output is correct
20 Correct 22 ms 1364 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 1364 KB Output is correct
2 Correct 5 ms 1364 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 4 ms 1312 KB Output is correct
5 Correct 8 ms 1364 KB Output is correct
6 Correct 6 ms 1364 KB Output is correct
7 Correct 6 ms 1364 KB Output is correct
8 Correct 10 ms 1364 KB Output is correct
9 Correct 7 ms 1364 KB Output is correct
10 Correct 20 ms 1364 KB Output is correct
11 Correct 21 ms 1364 KB Output is correct
12 Correct 28 ms 1364 KB Output is correct
13 Correct 19 ms 1364 KB Output is correct
14 Correct 19 ms 1424 KB Output is correct
15 Correct 18 ms 1364 KB Output is correct
16 Correct 21 ms 1364 KB Output is correct
17 Correct 11 ms 1364 KB Output is correct
18 Correct 17 ms 1364 KB Output is correct
19 Correct 17 ms 1364 KB Output is correct
20 Correct 22 ms 1364 KB Output is correct
21 Correct 59 ms 1364 KB Output is correct
22 Correct 67 ms 1416 KB Output is correct
23 Correct 42 ms 1416 KB Output is correct
24 Correct 105 ms 1408 KB Output is correct
25 Correct 106 ms 1420 KB Output is correct
26 Correct 122 ms 1364 KB Output is correct
27 Correct 112 ms 1408 KB Output is correct
28 Correct 112 ms 1404 KB Output is correct
29 Correct 137 ms 1364 KB Output is correct
30 Correct 109 ms 1364 KB Output is correct
31 Correct 108 ms 1416 KB Output is correct
32 Correct 122 ms 1408 KB Output is correct
33 Correct 138 ms 1364 KB Output is correct
34 Correct 118 ms 1364 KB Output is correct
35 Correct 116 ms 1408 KB Output is correct
36 Correct 138 ms 1412 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 1364 KB Output is correct
2 Correct 5 ms 1364 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 4 ms 1312 KB Output is correct
5 Correct 8 ms 1364 KB Output is correct
6 Correct 6 ms 1364 KB Output is correct
7 Correct 6 ms 1364 KB Output is correct
8 Correct 10 ms 1364 KB Output is correct
9 Correct 7 ms 1364 KB Output is correct
10 Correct 20 ms 1364 KB Output is correct
11 Correct 21 ms 1364 KB Output is correct
12 Correct 28 ms 1364 KB Output is correct
13 Correct 19 ms 1364 KB Output is correct
14 Correct 19 ms 1424 KB Output is correct
15 Correct 18 ms 1364 KB Output is correct
16 Correct 21 ms 1364 KB Output is correct
17 Correct 11 ms 1364 KB Output is correct
18 Correct 17 ms 1364 KB Output is correct
19 Correct 17 ms 1364 KB Output is correct
20 Correct 22 ms 1364 KB Output is correct
21 Correct 59 ms 1364 KB Output is correct
22 Correct 67 ms 1416 KB Output is correct
23 Correct 42 ms 1416 KB Output is correct
24 Correct 105 ms 1408 KB Output is correct
25 Correct 106 ms 1420 KB Output is correct
26 Correct 122 ms 1364 KB Output is correct
27 Correct 112 ms 1408 KB Output is correct
28 Correct 112 ms 1404 KB Output is correct
29 Correct 137 ms 1364 KB Output is correct
30 Correct 109 ms 1364 KB Output is correct
31 Correct 108 ms 1416 KB Output is correct
32 Correct 122 ms 1408 KB Output is correct
33 Correct 138 ms 1364 KB Output is correct
34 Correct 118 ms 1364 KB Output is correct
35 Correct 116 ms 1408 KB Output is correct
36 Correct 138 ms 1412 KB Output is correct
37 Correct 367 ms 1536 KB Output is correct
38 Correct 365 ms 1540 KB Output is correct
39 Correct 552 ms 1408 KB Output is correct
40 Correct 631 ms 1544 KB Output is correct
41 Correct 653 ms 1404 KB Output is correct
42 Correct 556 ms 1536 KB Output is correct
43 Correct 497 ms 1804 KB Output is correct
44 Correct 512 ms 1788 KB Output is correct
45 Correct 533 ms 1792 KB Output is correct
46 Correct 623 ms 1364 KB Output is correct
47 Correct 526 ms 1536 KB Output is correct
48 Correct 523 ms 1660 KB Output is correct
49 Correct 553 ms 1412 KB Output is correct
50 Correct 546 ms 1584 KB Output is correct
51 Correct 3 ms 340 KB Output is correct
52 Correct 618 ms 1796 KB Output is correct

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 1364 KB Output is correct
2 Correct 5 ms 1364 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 4 ms 1312 KB Output is correct
5 Correct 8 ms 1364 KB Output is correct
6 Correct 6 ms 1364 KB Output is correct
7 Correct 6 ms 1364 KB Output is correct
8 Correct 10 ms 1364 KB Output is correct
9 Correct 7 ms 1364 KB Output is correct
10 Correct 20 ms 1364 KB Output is correct
11 Correct 21 ms 1364 KB Output is correct
12 Correct 28 ms 1364 KB Output is correct
13 Correct 19 ms 1364 KB Output is correct
14 Correct 19 ms 1424 KB Output is correct
15 Correct 18 ms 1364 KB Output is correct
16 Correct 21 ms 1364 KB Output is correct
17 Correct 11 ms 1364 KB Output is correct
18 Correct 17 ms 1364 KB Output is correct
19 Correct 17 ms 1364 KB Output is correct
20 Correct 22 ms 1364 KB Output is correct
21 Correct 59 ms 1364 KB Output is correct
22 Correct 67 ms 1416 KB Output is correct
23 Correct 42 ms 1416 KB Output is correct
24 Correct 105 ms 1408 KB Output is correct
25 Correct 106 ms 1420 KB Output is correct
26 Correct 122 ms 1364 KB Output is correct
27 Correct 112 ms 1408 KB Output is correct
28 Correct 112 ms 1404 KB Output is correct
29 Correct 137 ms 1364 KB Output is correct
30 Correct 109 ms 1364 KB Output is correct
31 Correct 108 ms 1416 KB Output is correct
32 Correct 122 ms 1408 KB Output is correct
33 Correct 138 ms 1364 KB Output is correct
34 Correct 118 ms 1364 KB Output is correct
35 Correct 116 ms 1408 KB Output is correct
36 Correct 138 ms 1412 KB Output is correct
37 Correct 367 ms 1536 KB Output is correct
38 Correct 365 ms 1540 KB Output is correct
39 Correct 552 ms 1408 KB Output is correct
40 Correct 631 ms 1544 KB Output is correct
41 Correct 653 ms 1404 KB Output is correct
42 Correct 556 ms 1536 KB Output is correct
43 Correct 497 ms 1804 KB Output is correct
44 Correct 512 ms 1788 KB Output is correct
45 Correct 533 ms 1792 KB Output is correct
46 Correct 623 ms 1364 KB Output is correct
47 Correct 526 ms 1536 KB Output is correct
48 Correct 523 ms 1660 KB Output is correct
49 Correct 553 ms 1412 KB Output is correct
50 Correct 546 ms 1584 KB Output is correct
51 Correct 3 ms 340 KB Output is correct
52 Correct 618 ms 1796 KB Output is correct
53 Correct 756 ms 1664 KB Output is correct
54 Correct 981 ms 1740 KB Output is correct
55 Correct 995 ms 1924 KB Output is correct
56 Correct 787 ms 1804 KB Output is correct
57 Execution timed out 1064 ms 2056 KB Time limit exceeded
58 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 1364 KB Output is correct
2 Correct 5 ms 1364 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 4 ms 1312 KB Output is correct
5 Correct 8 ms 1364 KB Output is correct
6 Correct 6 ms 1364 KB Output is correct
7 Correct 6 ms 1364 KB Output is correct
8 Correct 10 ms 1364 KB Output is correct
9 Correct 7 ms 1364 KB Output is correct
10 Correct 20 ms 1364 KB Output is correct
11 Correct 21 ms 1364 KB Output is correct
12 Correct 28 ms 1364 KB Output is correct
13 Correct 19 ms 1364 KB Output is correct
14 Correct 19 ms 1424 KB Output is correct
15 Correct 18 ms 1364 KB Output is correct
16 Correct 21 ms 1364 KB Output is correct
17 Correct 11 ms 1364 KB Output is correct
18 Correct 17 ms 1364 KB Output is correct
19 Correct 17 ms 1364 KB Output is correct
20 Correct 22 ms 1364 KB Output is correct
21 Correct 59 ms 1364 KB Output is correct
22 Correct 67 ms 1416 KB Output is correct
23 Correct 42 ms 1416 KB Output is correct
24 Correct 105 ms 1408 KB Output is correct
25 Correct 106 ms 1420 KB Output is correct
26 Correct 122 ms 1364 KB Output is correct
27 Correct 112 ms 1408 KB Output is correct
28 Correct 112 ms 1404 KB Output is correct
29 Correct 137 ms 1364 KB Output is correct
30 Correct 109 ms 1364 KB Output is correct
31 Correct 108 ms 1416 KB Output is correct
32 Correct 122 ms 1408 KB Output is correct
33 Correct 138 ms 1364 KB Output is correct
34 Correct 118 ms 1364 KB Output is correct
35 Correct 116 ms 1408 KB Output is correct
36 Correct 138 ms 1412 KB Output is correct
37 Correct 367 ms 1536 KB Output is correct
38 Correct 365 ms 1540 KB Output is correct
39 Correct 552 ms 1408 KB Output is correct
40 Correct 631 ms 1544 KB Output is correct
41 Correct 653 ms 1404 KB Output is correct
42 Correct 556 ms 1536 KB Output is correct
43 Correct 497 ms 1804 KB Output is correct
44 Correct 512 ms 1788 KB Output is correct
45 Correct 533 ms 1792 KB Output is correct
46 Correct 623 ms 1364 KB Output is correct
47 Correct 526 ms 1536 KB Output is correct
48 Correct 523 ms 1660 KB Output is correct
49 Correct 553 ms 1412 KB Output is correct
50 Correct 546 ms 1584 KB Output is correct
51 Correct 3 ms 340 KB Output is correct
52 Correct 618 ms 1796 KB Output is correct
53 Correct 756 ms 1664 KB Output is correct
54 Correct 981 ms 1740 KB Output is correct
55 Correct 995 ms 1924 KB Output is correct
56 Correct 787 ms 1804 KB Output is correct
57 Execution timed out 1064 ms 2056 KB Time limit exceeded
58 Halted 0 ms 0 KB -