제출 #112046

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
112046		Eug1ena	Bali Sculptures (APIO15_sculpture)	C++14	9 / 100	1081 ms	548 KiB

sculpture

#include <bits/stdc++.h>
using namespace std;
using lint = long long;

int N, A, B;
vector<lint> sum{0};

lint notbit = 0;

lint dp[105][105];

bool minimum(int now, int cnt){
    if(now == N){
        return (A <= cnt && cnt <= B);
    }else if(dp[now][cnt] != -1){
        return dp[now][cnt];
    }
    bool ans = false;
    for(int i = now + 1; i <= N; i++){
        if(((sum[i] - sum[now]) & notbit) == 0){
            ans |= minimum(i, cnt + 1);
        }
    }
    return ans;
}

int main(){
    cin >> N >> A >> B;
    for(int i = 0; i < N; i++){
        lint Y;
        cin >> Y;
        lint item = sum.back() + Y;
        sum.push_back(item);
    }
    for(int i = 59; i >= 0; i--){
        notbit += (1l << i);
        memset(dp, -1, sizeof(dp));
        if(!minimum(0, 0)){
            notbit -= (1l << i);
        }
    }
    cout << (1l << 60) - 1 - notbit << endl;
}

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