제출 #388799

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
388799		phathnv	Bali Sculptures (APIO15_sculpture)	C++11	100 / 100	143 ms	4300 KiB

sculpture

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

typedef long long ll;

const int N = 2007;

int n, a, b, x[N];

namespace subtask4{
    bool dp[N][N];
    bool check(ll val){
        memset(dp, 0, sizeof(dp));
        dp[0][0] = 1;
        for(int i = 1; i <= n; i++)
            for(int j = 1; j <= b; j++){
                ll sum = 0;
                for(int k = i; k >= 1; k--){
                    sum += x[k];
                    if ((sum | val) == val)
                        dp[i][j] |= dp[k - 1][j - 1];
                }
            }
        for(int i = a; i <= b; i++)
            if (dp[n][i])
                return 1;
        return 0;
    }
    void solve(){
        ll answer = (1ll << 41) - 1;
        for(int i = 40; i >= 0; i--){
            answer ^= (1ll << i);
            if (!check(answer))
                answer ^= (1ll << i);
        }
        cout << answer;
    }
}

namespace subtask5{
    int dp[N];
    bool check(ll val){
        memset(dp, 0x3f, sizeof(dp));
        dp[0] = 0;
        for(int i = 1; i <= n; i++){
            ll sum = 0;
            for(int j = i; j >= 1; j--){
                sum += x[j];
                if ((sum | val) == val)
                    dp[i] = min(dp[i], dp[j - 1] + 1);
            }
        }
        return (dp[n] <= b);
    }
    void solve(){
        ll answer = (1ll << 41) - 1;
        for(int i = 40; i >= 0; i--){
            answer ^= (1ll << i);
            if (!check(answer))
                answer ^= (1ll << i);
        }
        cout << answer;
    }
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    cin >> n >> a >> b;
    for(int i = 1; i <= n; i++)
        cin >> x[i];
    if (n <= 100)
        subtask4::solve();
    else
        subtask5::solve();
    return 0;
}

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