oj.uz

답안 #952581

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
952581 2024-03-24T10:01:08 Z Unforgettablepl Bali Sculptures (APIO15_sculpture) C++17
0 / 100
 0 ms 376 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long

bool DP[101][101];
int DPmin[2001];
int arr[101];
int a,b,n;

bool testany(int k){
    for(auto&i:DP)for(auto&j:i)j=false;
    DP[0][0]=true;
    for(int j=1;j<=b;j++){
        for(int i=j;i<=n;i++){
            int sum = arr[i];
            for(int x=i-1;x>=j-1;x--){
                if((sum|k) == k and DP[x][j-1]){DP[i][j]=true;break;}
                sum+=arr[x];
            }
        }
    }
    for(int i=a;i<=b;i++)if(DP[n][i])return true;
    return false;
}

bool test1(int k){
    for(int i=1;i<=n;i++){
        int sum = arr[i];
        DPmin[i] = 1e15;
        for(int j=i-1;j>=0;j--){
            if((sum|k)==k)DPmin[i]=min(DPmin[i],DPmin[j]+1);
            sum+=arr[j];
        }
    }
    return DPmin[n]<=b;
}

bool test(int k){
    return a==1 ? test1(k) : testany(k);
}

bool check(int x){
    bool works = test(x);
    for(int bit=36;bit;bit--)if(x&(1<<bit))works = works or test((x^(1ll<<bit))|((1ll<<bit)-1ll));
    return works;
}

int32_t main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> n >> a >> b;
    for(int i=1;i<=n;i++)cin>>arr[i];
    int ans = -1;
    for(int jump = 68719476736ll;jump;jump/=2){
        if(!check(jump+ans))ans+=jump;
    }
    cout << ans+1 << '\n';
}

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -