oj.uz

Submission #319213

# Submission time Handle Problem Language Result Execution time Memory
319213 2020-11-04T14:09:28 Z BeanZ Bootfall (IZhO17_bootfall) C++14
0 / 100
 1 ms 364 KB 
// I_Love_LPL
#include <bits/stdc++.h>
using namespace std;
#define task "A"
#define ll int
#define endl '\n'
const int N = 505;
const int mod = 1e9 + 7;
const int lim = 10;
bitset<lim> bit;
bitset<lim> bit2, tmp;
ll a[N];
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    if (fopen(task".inp", "r")){
        freopen(task".inp", "r", stdin);
        freopen(task".out", "w", stdout);
    }
    ll n;
    cin >> n;
    ll sum = 0;
    for (int i = 1; i <= n; i++) cin >> a[i], sum += a[i];
    bit[0] = 1;
    for (int i = 1; i <= n; i++){
        bit |= (bit << a[i]);
    }
    if (bit[sum / 2] == 0) return cout << 0, 0;
    for (int i = 1; i <= lim; i++) bit2[i] = 1;
    for (int i = 1; i <= n; i++){
        bit.reset();
        bit[0] = 1;
        for (int j = 1; j <= n; j++){
            if (i == j) continue;
            bit |= (bit << a[j]);
        }
        tmp.reset();
        for (int j = 0; j <= lim; j++){
            if (bit[j] && ((sum - j - a[i] - j) > 0)){
                tmp[sum - j - a[i] - j] = 1;
            }
        }
        bit2 = bit2 & tmp;
    }
    vector<ll> ans;
    for (int i = 1; i <= lim; i++){
        if (bit2[i]) ans.push_back(i);
    }
    cout << ans.size() << endl;
    for (auto j : ans) cout << j << " ";
}
/*
4
1 3 1 5
6
3 5 7 11 9 13
3
2 2 2
*/

Compilation message

bootfall.cpp: In function 'int main()':
bootfall.cpp:17:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   17 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
bootfall.cpp:18:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   18 |         freopen(task".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 1 ms 364 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 1 ms 364 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 1 ms 364 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 1 ms 364 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 1 ms 364 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 1 ms 364 KB Output isn't correct
3 Halted 0 ms 0 KB -