Submission #127585

#	Time	Username	Problem	Language	Result	Execution time	Memory
127585		mahmoudbadawy	Bali Sculptures (APIO15_sculpture)	C++17	21 / 100	36 ms	31968 KiB

sculpture

#include <bits/stdc++.h>

using namespace std;

const int N=2005;

long long arr[N];
long long mem1[N][N],sum[N];
long long mem2[N],inf;
int n,a,b;

long long go(int ind,int gr)
{
	if(ind>=n&&a<=gr&&gr<=b)
		return 0;
	if(ind>=n)
		return (1LL<<60);
	if(mem1[ind][gr]!=inf)
		return mem1[ind][gr];
	mem1[ind][gr]=(1LL<<60);
	for(int i=ind;i<n;i++)
	{
		long long cur=go(i+1,gr+1);
		if(cur==(1LL<<60)) continue;
		mem1[ind][gr]=min(mem1[ind][gr],(sum[i]-(ind?sum[ind-1]:0))|cur);
	}
	return mem1[ind][gr];
}

int main()
{
	cin >> n >> a >> b;
	for(int i=0;i<n;i++)
		cin >> arr[i];
	/*if(n>100)
	{
		cout << "m3lsh" << endl;
	}
	else
	{*/
		memset(mem1,'?',sizeof mem1);
		inf=mem1[0][0];
		for(int i=0;i<n;i++)
			sum[i]=arr[i]+(i?sum[i-1]:0);
		cout << go(0,0) << endl;
	//}
}

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