Submission #243335

#	Time	Username	Problem	Language	Result	Execution time	Memory
243335		Leonardo_Paes	Bali Sculptures (APIO15_sculpture)	C++17	100 / 100	290 ms	508 KiB

sculpture

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
inline bool check(ll a, ll b){
    return ((a&b) == a);
}
int32_t main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
    int n, a, b;
    cin >> n >> a >> b;
    vector<int> v(n+1);
    for(int i=1; i<=n; i++) cin >> v[i];
    if(a == 1){
        vector<int> dp(n+1); // least k | it is possible to divide in k subarrays
        ll mask = ~(1LL<<63);
        for(int i=62; i>=0; i--){
            dp[0] = 0;
            for(int x=1; x<=n; x++) dp[x] = n+1;
            for(int x=1; x<=n; x++){
                ll sum = 0;
                for(int y=x; y>=1; y--){
                    sum += v[y];
                    if(check(sum, mask^(1LL<<i))) dp[x] = min(dp[x], 1 + dp[y-1]);
                }
            }
            if(dp[n] <= b) mask ^= (1LL<<i);
        }
        cout << mask << "\n";
    }
    else{
        vector<vector<int>> dp(n+1, vector<int>(n+1)); // it is possible to divide in k subarrays
        ll mask = ~(1LL<<63);
        for(int i=62; i>=0; i--){
            dp[0][0] = 1;
            for(int x=1; x<=n; x++){
                for(int y=1; y<=n; y++){
                    dp[y][x] = 0;
                    ll sum = 0;
                    for(int z=y; z>=1; z--){
                        sum += v[z];
                        if(check(sum, mask^(1LL<<i))) dp[y][x] |= dp[z-1][x-1];
                    }
                }
            }
            for(int x=a; x<=b; x++){
                if(dp[n][x]){
                    mask ^= (1LL<<i);
                    break;
                }
            }
        }
        cout << mask << "\n";
    }
    return 0;
}

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