제출 #1192270

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1192270		ChuanChen	Bali Sculptures (APIO15_sculpture)	C++20	100 / 100	62 ms	468 KiB

sculpture

#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
const int inf = 2e9;
int n, A, B;
ll sv[2005];
int dp1[2005];
bool dp2[105][105];
ll ans;
bool isSubmask(int b, ll val){
	return (ans>>b)==((ans>>b)|(val>>b));
}
bool solve1(int b){
	for(int i = 1; i <= n; i++) dp1[i] = inf;
	for(int i = 1; i <= n; i++)
		for(int j = 0; j < i; j++)
			if(isSubmask(b, sv[i]-sv[j])) dp1[i] = min(dp1[i], dp1[j]+1);
	if(dp1[n] <= B) return true;
	return false;
}
bool solve2(int b){
	for(int i = 1; i <= n; i++)
		for(int g = 1; g <= n; g++)
			dp2[i][g] = false;
	for(int i = 1; i <= n; i++)
		dp2[i][1] = isSubmask(b, sv[i]);

	for(int i = 1; i <= n; i++)
		for(int g = 1; g <= i; g++) if(dp2[i][g])
			for(int x = 1; i+x <= n; x++)
				dp2[i+x][g+1] |= isSubmask(b, sv[i+x]-sv[i]);

	for(int g = A; g <= B; g++)
		if(dp2[n][g]) return true;   
	return false;
}

int main(){
    cin.tie(0)->sync_with_stdio(0);
	cin >> n >> A >> B;
	for(int i = 1; i <= n; i++){
		int a; cin >> a;
		sv[i] = sv[i-1]+a;
	}

	for(int b = 40; b >= 0; b--){
		if(A==1){
			if(!solve1(b)) ans+=(1ll<<b);
		}
		else if(!solve2(b)) ans+=(1ll<<b);
	}
	cout << ans << '\n';
}

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