Submission #587306

#	Time	Username	Problem	Language	Result	Execution time	Memory
587306		Vanilla	Bali Sculptures (APIO15_sculpture)	C++17	0 / 100	955 ms	768 KiB

sculpture

#include <bits/stdc++.h>
using namespace std;
typedef long long int64;
const int maxn = 1e2 + 2;
const int maxbit = 300;
bool dp[maxn][maxn][maxbit];
int pref [maxn];
int arr[maxn];

int main() {
    int n,a,b;
    cin >> n >> a >> b;
    for (int i = 1; i <= n; i++){
        cin >> arr[i];
        pref[i] = pref[i-1] + arr[i];
        dp[i][1][pref[i]] = 1;
    }
    for (int k = 2; k <= b; k++){
        for (int r = 1; r <= n; r++){
            for (int l = 1; l <= r; l++){
                for (int ans = 0; ans < maxbit; ans++){
                    for (int to = 0; to <= ans; to++){
                        if (((to | (pref[r] - pref[l - 1])) == ans)) dp[r][k][ans] |= dp[l-1][k-1][to];
                    }
                }
            }
        }
    }
    // for (int i = 1; i <= b; i++){
    //     for (int j = 1; j <= n; j++){
    //         cout << setw(10) << dp[j][i] << " ";
    //     }
    //     cout << "\n";
    // }
    int rs = 1e9;
    for (int i = a; i <= b; i++){
        for (int j = 0; j < maxbit; j++)
            rs = min(rs, dp[n][i][j] ? j: (int) 1e9);
    }
    cout << rs << "\n";
    
    return 0;
}

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