제출 #1318657

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1318657		khanhphucscratch	Bali Sculptures (APIO15_sculpture)	C++20	50 / 100	100 ms	452 KiB

sculpture

#include<bits/stdc++.h>
#define int long long
using namespace std;
inline int flipbit(int num, int bit)
{
    return num ^ (1ll << bit);
}
int a[2005], dp[2005];
bool check(int x, int n, int l, int r)
{
    dp[0] = 0;
    for(int i = 1; i <= n; i++){
        dp[i] = 1e18;
        int cursum = 0;
        for(int j = i; j >= 1; j--){
            cursum += a[j];
            if((cursum & x) == cursum) dp[i] = min(dp[i], dp[j-1] + 1);
        }
    }
    return dp[n] <= r;
}
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    /*n <= 2000 but l = 1*/
    int n, l, r; cin>>n>>l>>r;
    for(int i = 1; i <= n; i++) cin>>a[i];
    int ans = (1ll << 50)-1;
    for(int i = 49; i >= 0; i--){
        ans = flipbit(ans, i);
        if(check(ans, n, l, r) == 0) ans = flipbit(ans, i); //Submask binary search technique
    }
    cout<<ans;
}

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