Submission #744902

#	Time	Username	Problem	Language	Result	Execution time	Memory
744902		Nelt	Bali Sculptures (APIO15_sculpture)	C++17	100 / 100	89 ms	352 KiB

sculpture

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,fma")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

/* DEFINES */
#define S second
#define F first
#define ll long long
#define ull unsigned long long
#define ld long double
#define npos ULLONG_MAX
#define INF LLONG_MAX
#define vv(a) vector<a>
#define pp(a, b) pair<a, b>
#define pq(a) priority_queue<a>
#define qq(a) queue<a>
#define ss(a) set<a>
#define mm(a, b) map<a, b>
#define ump(a, b) unordered_map<a, b>
#define sync                      \
    ios_base::sync_with_stdio(0); \
    cin.tie(0);                   \
    cout.tie(0);
#define elif else if
#define endl "\n"
#define allc(a) begin(a), end(a)
#define all(a) a, a + sizeof(a) / sizeof(a[0])
#define pb push_back
#define logi(a) __lg(a)
#define sqrt(a) sqrtl(a)
#define mpr make_pair
#define ins insert
using namespace std;
using namespace __gnu_pbds;
using namespace __cxx11;
typedef char chr;
typedef basic_string<chr> str;
template <typename T, typename key = less<T>>
using ordered_set = tree<T, null_type, key, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void solve()
{
    ll n, l, r;
    cin >> n >> l >> r;
    ll ans = (1ll << 41) - 1;
    ll a[n + 1];
    for (ll i = 1; i <= n; i++)
        cin >> a[i];
    if (l > 1)
    {
        bool dp[n + 1][n + 1];
        for (ll bit = 40; bit >= 0; bit--)
        {
            ans ^= (1ll << bit);
            for (ll i = 0; i <= n; i++)
                for (ll j = 0; j <= n; j++)
                    dp[i][j] = 0;
            dp[0][0] = 1;
            for (ll i = 1; i <= n; i++)
                for (ll cnt = 1; cnt <= n; cnt++)
                    for (ll j = i, sum = 0; j >= 1; j--)
                        sum += a[j], dp[i][cnt] |= dp[j - 1][cnt - 1] and (sum | ans) == ans;
            bool ok = false;
            for (ll i = l; i <= r; i++)
                ok |= dp[n][i];
            if (!ok)
                ans ^= (1ll << bit);
        }
    }
    else
    {
        ll dp[n + 1];
        for (ll bit = 40; bit >= 0; bit--)
        {
            ans ^= (1ll << bit);
            dp[0] = 0;
            for (ll i = 1; i <= n; i++)
            {
                dp[i] = n + 1;
                for (ll j = i, sum = 0; j >= 1; j--)
                    sum += a[j], dp[i] = min(dp[i], ((sum | ans) == ans ? dp[j - 1] + 1 : n + 1));
            }
            if (dp[n] > r)
                ans ^= (1ll << bit);
        }
    }
    cout << ans << endl;
}
/*

*/
int main()
{
    sync
        // precomp();
        ll t = 1;
    // cin >> t;
    for (ll i = 1; i <= t; i++)
        // cout << "Case #" << i << ": ",
        solve();
    cerr << "\nTime elapsed : " << clock() * 1000.0 / CLOCKS_PER_SEC << " ms\n";
}

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