제출 #905888

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
905888		Faisal_Saqib	Bali Sculptures (APIO15_sculpture)	C++17	71 / 100	1034 ms	604 KiB

sculpture

#include <iostream>
#include <set>
#include <algorithm>
#include <bitset>
#include <vector>
using namespace std;
#define ll long long
const ll inf=1e18;
const ll N=2002;
ll pre[N];
ll pw2[38];
bitset<N> posp[N];
int main()
{
	int n,a,b;
	cin>>n>>a>>b;
	pw2[0]=1;
	for(int i=1;i<38;i++)
		pw2[i]=(2ll*pw2[i-1]);
	for(int i=0;i<n;i++)
	{
		cin>>pre[i+1];
		pre[i+1]+=pre[i];
	}
	ll pos=pw2[37]-1;
	for(int i=36;i>=0;i--)
	{
		ll new_pos=pos-pw2[i];
		for(int i=0;i<=n;i++)
			for(int j=0;j<=n;j++)
				posp[i][j]=0;
		posp[0][0]=1;
		bool pos1=0;
		for(int i=1;i<=n;i++)
		{
			for(int j=1;j<=i;j++)
			{
				for(int k=0;k<i;k++)
				{
					if(posp[k][j-1])
					{
						bool das=1;
						ll np=(pre[i]-pre[k]);
						for(int bit=36;bit>=0;bit--)
							if((np&pw2[bit])>((new_pos&pw2[bit])))
								das=0;
						if(das)
							posp[i][j]=1;
					}
				}
				if(i==n and a<=j and j<=b and posp[i][j])
				{
					pos1=1;
				}
			}
		}
		if(pos1)
			pos=new_pos;
	}
	cout<<pos<<'\n';
	return 0;
}

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