제출 #660849

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
660849		danikoynov	Bali Sculptures (APIO15_sculpture)	C++14	71 / 100	68 ms	468 KiB

sculpture

#include <bits/stdc++.h>
#define endl '\n'

using namespace std;
typedef long long ll;

void speed()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}

const ll maxn = 101, maxbit = 62;

ll n, A, B, f[maxbit], aw[maxn];
ll dp[maxn][maxn][2];
ll a[maxn];
void solve()
{
    cin >> n >> A >> B;
    for (ll i = 1; i <= n; i ++)
        cin >> a[i];

        for (ll i = A; i <= B; i ++)
            aw[i] = 1;
            /// fix bit
    for (ll bit = maxbit - 1; bit >= 0; bit --)
    {
        dp[0][0][0] = dp[0][0][1] = 1;
        for (ll i = 1; i <= n; i ++)
            for (ll j = 1; j <= B; j ++)
            dp[i][j][0] = dp[i][j][1] = 0;

        for (ll i = 1; i <= n; i ++)
        {
            ll sum = 0;
            for (ll k = i; k > 0; k --)
            {
                sum += a[k];
                bool done = false;
                for (ll fbit = maxbit - 1; fbit > bit; fbit --)
                {
                    if ((sum & ((ll)(1) << fbit)) > 0 && f[fbit] == 0)
                    {
                        done = true;
                        break;
                    }
                }
                if (done)
                    continue;

                for (ll j = 1; j <= B; j ++)
                {
                    if (dp[k - 1][j - 1][1] == 1)
                        dp[i][j][1] = 1;
                }

                if ((sum & ((ll)(1) << bit)) > 0)
                    continue;

                for (ll j = 1; j <= B; j ++)
                {
                    if (dp[k - 1][j - 1][0] == 1)
                        dp[i][j][0] = 1;
                }

            }

        }            ll st = 1;
                for (ll j = A; j <= B; j ++)
                {
                    if (aw[j] && dp[n][j][0] == 1)
                        st = 0;
                }

            if (st == 1)
            {
                f[bit] = 1;
                for (ll j = A; j <= B; j ++)
                    aw[j] = min(aw[j], dp[n][j][1]);
            }
            else
            {
                for (ll j = A; j <= B; j ++)
                    aw[j] = min(aw[j], dp[n][j][0]);
            }
            //exit(0);
    }

    ll ans = 0;
    for (ll bit = 0; bit < maxbit; bit ++)
        if (f[bit])
        ans = ans + ((ll)(1) << bit);

    cout << ans << endl;
}

int main()
{
    solve();
    return 0;
}
/**
6 1 3
8 1 2 1 5 4
*/

컴파일 시 표준 에러 (stderr) 메시지

sculpture.cpp: In function 'void solve()':
sculpture.cpp:22:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   22 |     for (ll i = 1; i <= n; i ++)
      |     ^~~
sculpture.cpp:25:9: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   25 |         for (ll i = A; i <= B; i ++)
      |         ^~~

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