제출 #775118

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
775118		OrazB	Bali Sculptures (APIO15_sculpture)	C++14	100 / 100	124 ms	456 KiB

sculpture

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,
             tree_order_statistics_node_update>
    ordered_set;
//Dijkstra->set
//set.find_by_order(x) x-position value
//set.order_of_key(x) number of strictly less elements don't need *set.??
#define N 100005
#define wr cout << "Continue debugging\n";
#define all(x) (x).begin(), (x).end()
#define ll long long int
#define pii pair <ll, ll>
#define pb push_back
#define ff first
#define ss second

const ll inf = (1ll<<61)-1;
int n, A, B;
int a[N], c[N];
ll pref[N];

bool F(ll y, ll x){
	return (((x^y)|x) == x);
}

bool chk(ll x){
	vector<vector<int>> dp(n+1, vector<int>(n+1, 0));
	for (int i = 1; i <= n; i++){
		dp[i][1] = F(pref[i], x);
	}
	for (int i = 1; i <= n; i++){
		ll sum = 0;
		for (int j = i; j >= 1; j--){
			sum += a[j];
			if (F(sum, x)){
				for (int k = 1; k < n; k++){
					dp[i][k+1] |= dp[j-1][k];
				}
			}
		}
	}
	for (int i = A; i <= B; i++) if (dp[n][i]) return 1;
	return 0;
}

bool idi(ll x){
	vector<int> dp(n+1, 1e9);
	for (int i = 1; i <= n; i++){
		if (F(pref[i], x)) dp[i] = 1;
	}
	for (int i = 1; i <= n; i++){
		ll sum = 0;
		for (int j = i; j >= 1; j--){
			sum += a[j];
			if (F(sum, x)) dp[i] = min(dp[i], dp[j-1]+1);
		}
	}
	return (dp[n] <= B);
}

int main ()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> n >> A >> B;
	for (int i = 1; i <= n; i++){
		cin >> a[i];
		pref[i] = pref[i-1]+a[i];
	}
	ll ans = inf;
	for (ll i = 60; i >= 0; i--){
		if (A > 1){
			if (chk(ans-(1ll<<i))) ans -= (1ll<<i);
		}else{
			if (idi(ans-(1ll<<i))) ans -= (1LL<<i);
		}
	}
	cout << ans << '\n';
}	

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