제출 #507700

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
507700		oneloveforever	Bali Sculptures (APIO15_sculpture)	C++14	0 / 100	1 ms	304 KiB

sculpture

#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N=103;
const int MASK=(1<<14);
bool check[N][MASK][N];
const int inf=1e9+7;
int get_mask(int x,int y)
{
    return (x>>y)&1;
}
int main()
{
    int n,need_x,need_y;
    cin>>n>>need_x>>need_y;
    vector<int>a(n+1);
    for(int i=1;i<=n;i++)cin>>a[i];
    if(need_x==1)
    {
        int ans=0;
        for(int i=1;i<=n;i++)ans+=a[i];
        cout<<ans;
        return 0;
    }
    vector<int>sum(n+1);
    for(int i=1;i<=n;i++)sum[i]=sum[i-1]+a[i];
    int maxv=sum[n];
    memset(check,0,sizeof(check));
    check[0][0][0]=true;
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=i;j++)
        {
            int res=sum[i]-sum[j-1];
            for(int num=1;num<=need_y;num++)
            {
                for(int mask=0;mask<=maxv;mask++)
                {
                    if(check[j-1][mask][num-1]==false)continue;
                    int value=mask|res;
                    check[i][value][num]=true;
                    //cout<<check[i][value][num]<<" "<<i<<" "<<value<<" "<<num<<endl;
                }
            }
        }
    }
    int ans=inf;
    for(int i=need_x;i<=need_y;i++)
    {
        for(int mask=0;mask<=maxv;mask++)
        {
            if(check[n][mask][i])ans=min(ans,mask);
        }
    }
    cout<<ans;
}

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