oj.uz

Submission #739964

# Submission time Handle Problem Language Result Execution time Memory
739964 2023-05-11T19:04:13 Z Ahmed57 Bali Sculptures (APIO15_sculpture) C++14
0 / 100
 1 ms 304 KB 
#include <bits/stdc++.h>

using namespace std;
//Fast
int main(){
    int n,a,b;
    cin>>n>>a>>b;
    long long arr[n];
    for(int i = 0;i<n;i++){
        cin>>arr[i];
    }
    int dp[n+1] = {0};
    dp[n] = 0;
    long long num = (1LL<<30)-1 , sum = 0;int mi = 1e9;
    for(int bi = 29;bi>=0;bi--){
    num^=(1<<bi);
    for(int i = n-1;i>=0;i--){
        sum = arr[i];
        mi = 1e9;
        for(int j = i+1;j<=n;j++){
            if((sum|num)==num){
                mi = min(mi,dp[j]+1);
            }
            sum+=arr[j];
        }
        dp[i] = mi+1;
    }
    if(dp[0]>b+1){
        num^=(1<<bi);
    }
    }
    cout<<num<<endl;
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 1 ms 304 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -