oj.uz

Submission #1028496

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

typedef long long ll;

const int N = 2005;
int n, x, y;
ll a[N], dp[N][N];

int main(){
    cin >> n >> x >> y;
    for (int i = 1; i <= n; i ++)
        cin >> a[i], a[i] += a[i - 1];

    for (int i = 1; i <= n; i ++){
        for (int j = 1; j <= i; j ++){
            if (j == 1){
                dp[i][j] = a[i];
                continue;
            }

            dp[i][j] = 1e18;
            for (int k = j; k < i; k ++)
                dp[i][j] = min(dp[i][j], dp[k][j - 1] | (a[i] - a[k]));
        }
    }

    ll ans = 1e18;
    for (int i = x; i <= y; i ++)
        ans = min(ans, dp[n][i]);
    cout << ans << endl;
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 348 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 0 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 -