oj.uz

Submission #625569

# Submission time Handle Problem Language Result Execution time Memory
625569 2022-08-10T15:01:28 Z Do_you_copy Bootfall (IZhO17_bootfall) C++17
0 / 100
 0 ms 340 KB 
#include <bits/stdc++.h>
//#define int long long
#define fi first
#define se second
#define pb push_back
#define faster ios_base::sync_with_stdio(0); cin.tie(0);
using namespace std;
using ll = long long;
using ull = unsigned ll;
using ld = long double;
using pii = pair <int, int>;
using pil = pair <int, ll>;
using pli = pair <ll, int>;
using pll = pair <ll, ll>;
mt19937 Rand(chrono::steady_clock::now().time_since_epoch().count());

ll min(const ll &a, const ll &b){
    return (a < b) ? a : b;
}

ll max(const ll &a, const ll &b){
    return (a > b) ? a : b;
}

//const ll Mod = 1000000007;
//const ll Mod2 = 999999999989;
//only use when required
const int maxN = 502 + 1;
const int maxB = 25001;
int n;
int a[maxN];
int sum;
bitset <maxB> bit[5000];
int pos[maxN];
void build(int id, int l, int r){
    if (l == r){
        pos[r] = id;
        return;
    }
    int mid = (l + r) / 2;
    bit[id * 2 + 1] = bit[id * 2] = bit[id];
    for (int i = l; i <= mid; ++i){
        bit[id * 2 + 1] =  bit[id * 2 + 1] | (bit[id * 2 + 1] << a[i]);
    }
    for (int i = mid + 1; i <= r; ++i){
        bit[id * 2] = bit[id * 2] | (bit[id * 2] << a[i]);
    }
    build(id * 2, l, mid);
    build(id * 2 + 1, mid + 1, r);
}

void Init(){
    cin >> n;
    for (int i = 1; i <= n; ++i){
        cin >> a[i];
        sum += a[i];
    }
    bit[1][0] = 1;
    build(1, 1, n);
    bitset <maxB> S = bit[pos[1]] | (bit[pos[1]] << a[1]);
    if (sum % 2 || !S[sum / 2]){
        cout << 0;
        return;
    }
    vector <int> ans;
    for (int i = 1; i <= n * n; ++i){
        bool flag = 0;
        for (int j = 1; j <= n; ++j){
            int cur = sum - a[j] + i;
            int t = cur / 2;
            if (cur % 2 || i > t || (!bit[pos[j]][t] && !bit[pos[j]][t - i])){
                flag = 1;
                break;
            }
        }
        if (!flag) ans.pb(i);
    }
    cout << ans.size() << "\n";
    for (int i: ans) cout << i << ' ';
}

#define debu
#define taskname "test"
signed main(){
    if (fopen(taskname".inp", "r")){
        freopen(taskname".inp", "r", stdin);
        #ifdef debug
        freopen(taskname".out", "w", stdout);
        #endif
    }
    faster;
    ll tt = 1;
    //cin >> tt;
    while (tt--){
        Init();
    }
    if (fopen("timeout.txt", "r")){
        ofstream timeout("timeout.txt");
        timeout << 1000 * double(clock()) / CLOCKS_PER_SEC;
        #ifndef debug
        cerr << "\nTime elapsed: " << 1000 * double(clock()) / CLOCKS_PER_SEC << "ms\n";
        #endif
    }
}

Compilation message

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

Subtask #1
0 / 6.0

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

Subtask #2
0 / 7.0

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

Subtask #3
0 / 15.0

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

Subtask #4
0 / 16.0

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

Subtask #5
0 / 21.0

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

Subtask #6
0 / 35.0

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