oj.uz

Submission #49954

# Submission time Handle Problem Language Result Execution time Memory
49954 2018-06-05T06:27:23 Z someone_aa Bali Sculptures (APIO15_sculpture) C++17
0 / 100
 4 ms 664 KB 
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll dp[2100][2100];
int main() {
    ll n, a, b;
    cin>>n>>a>>b;

    ll arr[2100], pref[2100];
    pref[0] = 0;
    for(int i=1;i<=n;i++) {
        cin>>arr[i];
        pref[i] = pref[i-1] + arr[i];
    }

    for(int i=1;i<=n;i++) {
        for(int j=1;j<=b;j++) {
            dp[i][j] = LLONG_MAX;
            for(int k=i;k>=1;k--) {
                if(j==1 && k == 1) dp[i][j] = pref[i] - pref[0];
                else {
                    if(i >= j && k >= j-1) {
                        dp[i][j] = min(dp[i][j], dp[k-1][j-1] | (pref[i] - pref[k-1]));
                    }
                }
            }
        }
    }

    ll result = LLONG_MAX;
    for(int i=a;i<=b;i++) {
        result = min(result, dp[n][i]);
    }
    cout<<result<<"\n";
    return 0;
}

Subtask #1
0 / 9.0

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

Subtask #2
0 / 16.0

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

Subtask #3
0 / 21.0

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

Subtask #4
0 / 25.0

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

Subtask #5
0 / 29.0

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