oj.uz

답안 #141399

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
141399 2019-08-07T21:03:45 Z silxikys Bali Sculptures (APIO15_sculpture) C++14
0 / 100
 2 ms 504 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

const int maxn = 2e3+5;
const ll inf = 1LL<<60;
int N;
ll A[maxn], pre[maxn];
ll dp[maxn][maxn];
int a, b;

int main()
{
    //ios_base::sync_with_stdio(false); cin.tie(NULL);
    cin >> N;
    cin >> a >> b;
    for (int i = 1; i <= N; i++) {
        cin >> A[i];
        pre[i] = pre[i-1] + A[i];
    }
    for (int i = 0; i <= N; i++) {
        for (int k = 0; k <= N; k++) {
            dp[i][k] = inf;
        }
    }
    dp[0][0] = 0;
    for (int i = 1; i <= N; i++) {
        for (int k = 1; k <= N; k++) {
            dp[i][k] = inf;
            for (int j = 0; j < i; j++) {
                //cout << j << ' ' << (dp[j][k-1]|(pre[i]-pre[j])) << '\n';
                dp[i][k] = min(dp[i][k],
                               dp[j][k-1]|(pre[i]-pre[j]));
                //cout << dp[i][k] << '\n';
            }
            //printf("[%d][%d]: %lld\n",i,k,dp[i][k]);
        }
    }
    cout << dp[N][b] << '\n';
}

Subtask #1
0 / 9.0

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

Subtask #2
0 / 16.0

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

Subtask #3
0 / 21.0

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

Subtask #4
0 / 25.0

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

Subtask #5
0 / 29.0

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