Submission #705109

#	Time	Username	Problem	Language	Result	Execution time	Memory
705109		bebra	Bali Sculptures (APIO15_sculpture)	C++17	0 / 100	1 ms	224 KiB

sculpture

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

#define dbg(x) cerr << #x << ": " << x << endl;

const int MAX_BIT = 44;
const int MAX_N = 2000 + 5;
const int MAX_X = 20;
int a[MAX_N];


int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, l, r;
    cin >> n >> l >> r;
    for (int i = 1; i <= n; ++i) {
        cin >> a[i];
    }
    // minimize (a1 + a2 + ... + a_(k - 1)) | (a_k + a_(k + 1) + ...) | ... 
    // IMPORTANT NOTE: IN LAST GROUP n = 2000 and l = 1
    // maybe greedy bit by bit? minimize first, then second, ...


    auto check = [&](ll mask) {
        int groups_n = 1;
        ll curr_sum = 0;
        for (int i = 1; i <= n; ++i) {
            if (((curr_sum + a[i]) & mask) == 0) {
                curr_sum += a[i];
            } else {
                curr_sum = a[i];
                ++groups_n;
            }
        }
        return groups_n <= r;
    };

    ll ans = 0;
    ll mask = 0;
    for (int bit = MAX_BIT; bit >= 0; --bit) {
        if (!check(mask | (1LL << bit))) {
            ans |= 1LL << bit;
        } else {
            mask |= 1LL << bit;
        }
    }

    cout << ans << '\n';

    return 0;
}

/*
6 1 3
8 1 2 1 5 4
*/

• Subtask 1: 0 / 9
• Subtask 2: 0 / 16
• Subtask 3: 0 / 21
• Subtask 4: 0 / 25
• Subtask 5: 0 / 29