Submission #881152

#	Time	Username	Problem	Language	Result	Execution time	Memory
881152		Lobo	Bali Sculptures (APIO15_sculpture)	C++17	100 / 100	113 ms	612 KiB

sculpture

#include<bits/stdc++.h>
using namespace std;
const long long inf = (long long) 1e18 + 10;
const int inf1 = (int) 1e9 + 10;
#define int long long
#define dbl long double
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()
const int maxn = 2e3+10;

int n,a,b,y[maxn], pf[maxn];

bool sol(int val) {
    vector<int> dp(n+1,inf);
    dp[0] = 0;

    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= i; j++) {
            if(((pf[i]-pf[j-1])&val) == 0) {
                dp[i] = min(dp[i],dp[j-1]+1);
            }
        }
    }
    return (dp[n] <= b);
}

bool sol1(int val) {
    vector<vector<int>> dp(n+1,vector<int>(n+1,0));
    dp[0][0] = 1;

    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= i; j++) {
            if(((pf[i]-pf[j-1])&val) == 0) {
                for(int k = 1; k <= n; k++) {
                    dp[i][k]|= dp[j-1][k-1];
                }
            }
        }
    }

    for(int i = a; i <= b; i++) {
        if(dp[n][i]) return true;
    }
    return false;
}

void solve() {
    cin >> n >> a >> b;
    for(int i = 1; i <= n; i++) {
        cin >> y[i];
        pf[i] = pf[i-1]+y[i];
    }

    if(a == 1) {
        int ans = 0;
        for(int p = 60; p >= 0; p--) {
            if(sol(ans+(1LL<<p))) {
                ans+= (1LL<<p);
            }
        }

        cout << (1LL<<61)-1-ans << endl;
    }
    else {
        int ans = 0;
        for(int p = 60; p >= 0; p--) {
            if(sol1(ans+(1LL<<p))) {
                ans+= (1LL<<p);
            }
        }

        cout << (1LL<<61)-1-ans << endl;
    }
}
    
int32_t main() {
    ios::sync_with_stdio(false); cin.tie(0);

    // freopen("in.in", "r", stdin);
    // freopen("out.out", "w", stdout);
    int tt = 1;
    // cin >> tt;
    while(tt--) {
        solve();
    }

}

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