oj.uz

답안 #985506

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
985506 2024-05-18T02:08:08 Z muratcepeda Bali Sculptures (APIO15_sculpture) C++17
0 / 100
 1 ms 504 KB 
#include <bits/stdc++.h>

using namespace std;
#define lli long long int
#define rep(i, a, b) for(int i = a; i <= b; i++)


#define MAX 100
#define MAXM 

lli n, a, b, y[MAX + 3], dp[MAX + 3][MAX + 3];

int main(){

    cin >> n >> a >> b;

    rep(i, 1, n){
        cin >> y[i];
        if(i > 1) dp[1][i] = y[i] + dp[1][i - 1];
        else dp[1][i] = y[i];
    }
    rep(fil, 2, b){
        rep(col, 1, n) dp[fil][col] = (1ll << 62);
    }
    rep(fil, 2, b){
        rep(col, fil, n){
            lli suma = y[col];
            for(int i = col - 1; i >= fil - 1; --i){
                dp[fil][col] = min(dp[fil][col], suma | dp[fil - 1][i]);
                suma += y[i];
            }
        }
    }
    lli res = (1ll << 62);
    rep(i, a, b){
        res = min(res, dp[i][n]);
    }
    cout << res;

    return 0;
}

Subtask #1
0 / 9.0

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

Subtask #2
0 / 16.0

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 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 #4
0 / 25.0

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

Subtask #5
0 / 29.0

# 결과 실행 시간 메모리 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 -