제출 #90598

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
90598		314rate	Bali Sculptures (APIO15_sculpture)	C++14	0 / 100	3 ms	632 KiB

sculpture

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;

const int N=100+5;

int n,a,b;
ll p[N];

ll ask(int st,int dr)
{
    return p[dr]-p[st-1];
}

bool valid[N][N];
ll dp[N][N];

void b100()
{
    for(int i=1;i<=n;i++)
    {
        valid[i][1]=1;
        dp[i][1]=ask(1,i);
        for(int j=2;j<=i;j++)
        {
            for(int ant=1;ant<i;ant++)
            {
                if(valid[ant][j-1])
                {
                    ll val=(dp[ant][j-1]|ask(ant+1,i));
                    if(valid[i][j]==0)
                    {
                        valid[i][j]=1;
                        dp[i][j]=val;
                    }
                    else
                    {
                        dp[i][j]=min(dp[i][j],val);
                    }
                }
            }
        }
    }
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin>>n>>a>>b;
    for(int i=1;i<=n;i++)
    {
        ll x;
        cin>>x;
        p[i]=p[i-1]+x;
    }
    if(n<=100)
    {
        b100();
        ll ans;
        bool g=0;
        for(int j=a;j<=b;j++)
        {
            if(valid[n][j]==0) continue;
            if(g==0)
            {
                g=1;
                ans=dp[n][j];
            }
            else
            {
                ans=min(ans,dp[n][j]);
            }
        }
        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