제출 #40470

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

sculpture

#include <bits/stdc++.h>
#define N 2005
using namespace std;
typedef long long ll;

int n, A, B, v[N];

ll dp[N][N], sum[N], ans = 200000000000000000LL;

int main()
{
	ios::sync_with_stdio(false); cin.tie(0);

	cin>>n>>A>>B;

	for(int i = 1; i <= n; i++)
	{
		cin>>v[i], sum[i] = sum[i - 1] + (ll)v[i], dp[i][1] = sum[i];

		if(A <= 1 && 1 <= B && i == n) ans = min(ans, dp[i][1]);
	}

	for(int k = 2; k <= B; k++)
	{
		for(int i = 1; i <= n; i++)
		{
			dp[i][k] = 200000000000000000LL;

			if(i < k) continue;

			for(int j = 1; j <= i; j++)
			{
				if(j - 1 < k - 1) continue;

				dp[i][k] = min( (dp[j - 1][k - 1] | (sum[i] - sum[j - 1])), dp[i][k]);

				//cout<<dp[j - 1][k - 1]<<" "<<(sum[i] - sum[j - 1])<<" "<<(dp[j - 1][k - 1] | (sum[i] - sum[j - 1]))<<"\n";
			}

			if(A <= k && k <= B && i == n) ans = min(ans, dp[i][k]);

			//cout<<i<<" "<<k<<" "<<dp[i][k]<<"\n";
		}
	}

	cout<<ans<<"\n";
}

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