Submission #1197668

#	Time	Username	Problem	Language	Result	Execution time	Memory
1197668		nvc2k8	Bali Sculptures (APIO15_sculpture)	C++20	100 / 100	90 ms	556 KiB

sculpture

#include <bits/stdc++.h>
#define TASK "sculpture"
#define INT_LIM (int) 2147483647
#define LL_LIM (long long) 9223372036854775807
#define endl '\n'
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define BIT(i,x) (((i)>>(x))&1)
#define FOR(i,a,b) for(int i = (a); i<=(b); i++)
#define FORD(i,a,b) for(int i = (a); i>=(b); i--)
#define ll long long
#define pii pair<int,int>
using namespace std;
///------------------------------------------///
int n,l,r;
ll a[2005];

void inp()
{
    cin >> n >> l >> r;
    FOR(i, 1, n) cin >> a[i];
}

namespace Sub4{

    ll mask = 0;
    bool dp[101][101];
    ll sum[101];

    void solve()
    {
        FOR(i, 1, n) sum[i] = sum[i-1]+a[i];

        dp[0][0] = true;
        FORD(pos, 40, 0)
        {
            mask|=(1LL<<pos);

            FOR(i, 1, n) FOR(j, 0, n) dp[i][j] = false;

            FOR(i, 1, n) FOR(j, 1, n)
            {
                FOR(t, 1, i)
                {
                    ll val = sum[i]-sum[t-1];
                    if ((val&mask)==0) dp[i][j]|= dp[t-1][j-1];
                }
            }

            bool flag = false;
            FOR(i, l, r)
            {
                if (dp[n][i])
                {
                    flag = true; break;
                }
            }
            if (!flag) mask^=(1LL<<pos);
        }

        ll ans = ((1LL<<41)-1)^mask;
        cout << ans;

        exit(0);
    }
}

namespace Sub5{

    ll mask = 0;
    int dp[2001];
    ll sum[2001];

    void solve()
    {
        FOR(i, 1, n) sum[i] = sum[i-1]+a[i];

        FORD(pos, 40, 0)
        {
            mask|=(1LL<<pos);

            FOR(i, 1, n) dp[i] = INT_LIM;

            FOR(i, 1, n)
            {
                FOR(j, 1, i) if (dp[j-1]!=INT_LIM)
                {
                    ll val = sum[i]-sum[j-1];
                    if ((val&mask)==0) dp[i] = min(dp[i], dp[j-1]+1);
                }
            }

            if (dp[n]>r) mask^=(1LL<<pos);
        }

        ll ans = ((1LL<<41)-1)^mask;
        cout << ans;

        exit(0);
    }
}

void solve()
{
    if (n<=100) Sub4::solve();
    Sub5::solve();
}

signed main()
{
    ///--------------------------///
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    if (fopen(TASK".INP","r")!=NULL)
    {
        freopen(TASK".INP","r",stdin);
        freopen(TASK".OUT","w",stdout);
    }
    ///--------------------------///

    int NTEST = 1;
    //cin >> NTEST;

    while (NTEST--)
    {
        inp();
        solve();
    }

    return 0;
}

///------------------------------------------///

Compilation message (stderr)

sculpture.cpp: In function 'int main()':
sculpture.cpp:117:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  117 |         freopen(TASK".INP","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sculpture.cpp:118:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  118 |         freopen(TASK".OUT","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

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