Submission #897255

#	Time	Username	Problem	Language	Result	Execution time	Memory
897255		TahirAliyev	Bali Sculptures (APIO15_sculpture)	C++17	100 / 100	133 ms	16136 KiB

sculpture

#include <bits/stdc++.h>

#define ll long long
#define oo 1e9
#define pii pair<int, int>

using namespace std;

const int MAX = 2002;

int n, a, b;
int arr[MAX];
ll pre[MAX];
ll cur = 0;

int dp[MAX][MAX];

bool rec(int i, int k, int bit){
    if(i == n + 1){
        if(k >= a && k <= b) return 1;
        else return 0;
    }
    if(dp[i][k] != -1) return dp[i][k];
    for(int j = i + 1; j <= n + 1; j++){
        if((cur | (pre[j - 1] - pre[i - 1])) >> bit << bit == cur && rec(j, k + 1, bit)){
            return dp[i][k] = 1;
        }
    }
    return dp[i][k] = 0;
}

int dp2[MAX];

int rec2(int i, int bit){
    if(i == n + 1) return 0;
    if(dp2[i] != -1) return dp2[i];
    int ans = oo;
    for(int j = i + 1; j <= n + 1; j++){
        if((cur | (pre[j - 1] - pre[i - 1])) >> bit << bit == cur){
            ans = min(1 + rec2(j, bit), ans);
        }
    }
    return dp2[i] = ans;
}

int main(){
    cin >> n >> a >> b;
    for(int i = 1; i <= n; i++){
        cin >> arr[i];
        pre[i] = pre[i - 1] + arr[i];
    }
    for(int B = 40; B >= 0; B--){
        if(a == 1){
            memset(dp2, -1, sizeof(dp2));
            if(rec2(1, B) > b){
                cur |= (1ll << B);
            }
        }
        else{
            memset(dp, -1, sizeof(dp));
            if(!rec(1, 0, B)){
                cur |= (1ll << B);
            }
        }
    }
    cout << cur << '\n';
}

Compilation message (stderr)

sculpture.cpp: In function 'bool rec(int, int, int)':
sculpture.cpp:26:29: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   26 |             return dp[i][k] = 1;
      |                    ~~~~~~~~~^~~
sculpture.cpp:29:21: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   29 |     return dp[i][k] = 0;
      |            ~~~~~~~~~^~~

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