제출 #264195

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
264195		Berted	Bali Sculptures (APIO15_sculpture)	C++14	100 / 100	130 ms	504 KiB

sculpture

#include <iostream>
#include <set>
#include <algorithm>
#include <vector>
#include <assert.h>
#define ll long long
using namespace std;

const ll INF = 1e16;
const int LG = 40;

int n, l, r;
ll pref[2001];
bool dp[101][101];
int dp2[2001];

int main()
{
	cin >> n >> l >> r;
	for (int i = 1; i <= n; i++)
	{
		cin >> pref[i];
		pref[i] += pref[i - 1];
	}
	if (l > 1)
	{
		ll curPref = 0;
		for (int i = LG; i >= 0; i--)
		{
			ll checkAgainst = curPref | ((1LL << i) - 1);
			for (int j = 0; j <= n; j++)
			{
				for (int k = 0; k <= n; k++) dp[j][k] = 0;
			}
			dp[0][0] = 1;
			for (int j = 0; j < n; j++)
			{
				for (int k = 0; k < n; k++)
				{
					if (dp[j][k])
					{
						for (int l = k + 1; l <= n; l++)
						{
							if (((pref[l] - pref[k]) | checkAgainst) == checkAgainst) dp[j + 1][l] |= dp[j][k];
						}
					}
				}
			}
			for (int j = l; j <= r; j++)
			{
				if (dp[j][n]) {break;}
				else if (j == r) {curPref |= (1LL << i);}
			}
		}
		cout << curPref << "\n";
	}
	else
	{
		ll curPref = 0;
		for (int i = LG; i >= 0; i--)
		{
			ll checkAgainst = curPref | ((1LL << i) - 1);
			for (int j = 0; j <= n; j++) dp2[j] = 1000000000;
			dp2[0] = 0;
			for (int k = 0; k < n; k++)
			{
				if (dp2[k] != 1000000000)
				{
					for (int l = k + 1; l <= n; l++)
					{
						if (((pref[l] - pref[k]) | checkAgainst) == checkAgainst) dp2[l] = min(dp2[l], dp2[k] + 1);
					}
				}
			}
			if (dp2[n] > r) {curPref |= (1LL << i);}
		}
		cout << curPref << "\n";
	}
	return 0;
}

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