제출 #119117

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
119117		Charis02	Bali Sculptures (APIO15_sculpture)	C++14	21 / 100	11 ms	9344 KiB

sculpture

#include<iostream>
#include<stdio.h>
#include<vector>
#include<cmath>
#include<queue>
#include<string.h>
#include<map>
#include<set>
#include<algorithm>
#define ll long long
#define pi pair < ll,ll >
#define mp(a,b) make_pair(a,b)
#define rep(i,a,b) for(int i = a;i < b;i++)
#define N 104
#define INF 1e9+7

using namespace std;

ll n,a,b,ar[N];
ll dp[N][N][N];
ll psum[N];

ll get_sum(ll i,ll j)
{
    if(i == 0)
        return psum[j];
    return psum[j]-psum[i-1];
}

ll solve(ll cur,ll start,ll g)
{
    if(g > b)
        return INF;
    if(cur == n)
    {
        if(g < a)
            return INF;

        return get_sum(start,n-1);
    }

    if(dp[cur][start][g] != -1)
        return dp[cur][start][g];

    return dp[cur][start][g] = min(solve(cur+1,start,g),get_sum(start,cur)|solve(cur+1,cur+1,g+1));
}

int main()
{
    ios_base::sync_with_stdio(false);

    cin >> n >> a >> b;

    memset(dp,-1,sizeof dp);

    rep(i,0,n)
    {
        cin >> ar[i];

        if(i == 0)
            psum[i] = ar[i];
        else
            psum[i] = ar[i]+psum[i-1];
    }

    cout << solve(0,0,1);
    return 0;
}

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