oj.uz

Submission #615631

# Submission time Handle Problem Language Result Execution time Memory
615631 2022-07-31T11:20:37 Z bebra Candies (JOI18_candies) C++17
0 / 100
 246 ms 320 KB 
#include <bits/stdc++.h>
using namespace std;


int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    cin >> n;
    vector<int> a(n);
    for (int& x : a) cin >> x;
    int max_j = (n + 1) / 2;
    vector<long long> ans(max_j + 1);
    for (int mask = 1; mask <= (1 << n) - 1; ++mask) {
        int cnt = __builtin_popcount(mask);
        bool bad = false;
        for (int i = 0; i < n - 1; ++i) {
            if ((mask & (1 << i)) && (mask & (1 << (i + 1)))) {
                bad = true;
            }
        }
        long long sum = 0;
        for (int i = 0; i < n; ++i) {
            if (mask & (1 << i)) sum += a[i];
        }
        if (!bad) {
            ans[cnt] = max(ans[cnt], sum);
        }
    }
    for (int j = 1; j <= max_j; ++j) {
        cout << ans[j] << '\n';
    }
    
    
    return 0;
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 246 ms 320 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 92.0

# Verdict Execution time Memory Grader output
1 Incorrect 246 ms 320 KB Output isn't correct
2 Halted 0 ms 0 KB -