제출 #125927

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
125927		jakob_nogler	Bali Sculptures (APIO15_sculpture)	C++14	37 / 100	11 ms	504 KiB

sculpture

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vb> vvb;

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

    int n, a, b;
    cin >> n >> a >> b;
    vi val(n);
    for(int i = 0; i < n; i++)
        cin >> val[i];

    ll curr = 0;
    if(a == 1){
        for(int i = 31; i >= 0; i--){
            vi cnt(n + 1, n + 1);

            cnt[0] = 0;
            for(int j = 0; j < n; j++){
                ll sum = 0;
                for(int k = j; k < n; k++){
                    sum += val[k];

                    if(((sum >> i) | (curr >> i)) == (curr >> i))
                        cnt[k + 1] = min(cnt[k + 1], cnt[j] + 1);
                }
            }

            if(cnt[n] > b)
                curr |= (1 << i);
        }
    }
    else{
        for(int i = 31; i >= 0; i--){
            vvb mat(n + 1, vb(n + 1));

            mat[0][0] = true;

            for(int j = 0; j < n; j++){
                ll sum = 0;
                for(int k = j; k < n; k++){
                    sum += val[k];

                    if(((sum >> i) | (curr >> i)) == (curr >> i)){
                        for(int l = 0; l < n; l++)
                            if(mat[j][l])
                                mat[k + 1][l + 1] = true;
                    }
                }
            }

            bool ans = false;
            for(int j = a; j <= b; j++)
                ans |= mat[n][j];
            if(!ans) curr |= (1 << i);
        }
    }

    cout << curr << endl;
}

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