oj.uz

Submission #950336

# Submission time Handle Problem Language Result Execution time Memory
950336 2024-03-20T08:30:36 Z Unforgettablepl Bali Sculptures (APIO15_sculpture) C++17
0 / 100
 1 ms 348 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long

int DP[2001][2001];
int arr[2001];

int32_t main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int n,a,b;
    cin >> n >> a >> b;
    for(int i=1;i<=n;i++)cin>>arr[i];
    for(int i=1;i<=n;i++)DP[i][0]=INT64_MAX;
    for(int j=1;j<=b;j++){
        for(int i=j;i<=n;i++){
            int sum = arr[i];
            DP[i][j] = INT64_MAX;
            for(int x=i-1;x>=j-1;x--){
                DP[i][j]=min(DP[i][j],DP[x][j-1]|sum);
                sum+=arr[x];
            }
        }
    }
    cout << DP[n][b] << '\n';
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 1 ms 348 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 348 KB Output is correct
2 Incorrect 0 ms 348 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 344 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

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

Subtask #5
0 / 29.0

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