oj.uz

답안 #634095

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
634095 2022-08-23T19:47:44 Z tvladm2009 Bali Sculptures (APIO15_sculpture) C++14
0 / 100
 193 ms 262148 KB 
#include <iostream>
#include <vector>
#define int long long

using namespace std;

const int MAX_N = 2 * 1e3;
const int INF = (1LL << 60);
const int MAX_L = 11;
int y[MAX_N + 1], range[MAX_N + 1][MAX_N + 1];
vector<int> dp[MAX_N + 1][MAX_N + 1];
int n, a, b;

signed main() {
    cin >> n >> a >> b;
    for (int i = 1; i <= n; i++) {
        cin >> y[i];
        range[i][i] = y[i];
    }
    for (int i = 1; i <= n; i++) {
        for (int j = i + 1; j <= n; j++) {
            range[i][j] = range[i][j - 1] + y[j];
        }
    }
    for (int i = 0; i <= n; i++) {
        for (int j = 0; j <= n; j++) {
            dp[i][j].push_back(INF);
        }
    }
    dp[0][0].push_back(0);
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            for (int k = 1; k <= i; k++) {
                for (int it : dp[k - 1][j - 1]) {
                    dp[i][j].push_back(it | range[k][i]);
                }
            }
        }
    }
    int answer = INF;
    for (int i = a; i <= b; i++) {
        for (int it : dp[n][i]) {
            answer = min(answer, it);
        }
    }
    cout << answer;
    return 0;
}

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 94284 KB Output is correct
2 Correct 44 ms 94276 KB Output is correct
3 Correct 42 ms 94208 KB Output is correct
4 Correct 45 ms 94316 KB Output is correct
5 Correct 51 ms 94428 KB Output is correct
6 Correct 51 ms 100088 KB Output is correct
7 Correct 63 ms 118572 KB Output is correct
8 Runtime error 169 ms 262144 KB Execution killed with signal 9
9 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 94264 KB Output is correct
2 Correct 44 ms 94276 KB Output is correct
3 Correct 43 ms 94300 KB Output is correct
4 Correct 46 ms 94344 KB Output is correct
5 Correct 45 ms 94548 KB Output is correct
6 Correct 47 ms 100036 KB Output is correct
7 Correct 60 ms 118560 KB Output is correct
8 Runtime error 193 ms 262148 KB Execution killed with signal 9
9 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 94360 KB Output is correct
2 Correct 53 ms 94392 KB Output is correct
3 Correct 46 ms 94324 KB Output is correct
4 Correct 49 ms 94344 KB Output is correct
5 Correct 45 ms 94440 KB Output is correct
6 Correct 50 ms 100060 KB Output is correct
7 Correct 64 ms 118628 KB Output is correct
8 Runtime error 172 ms 262144 KB Execution killed with signal 9
9 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 94356 KB Output is correct
2 Correct 44 ms 94384 KB Output is correct
3 Correct 47 ms 94320 KB Output is correct
4 Correct 47 ms 94340 KB Output is correct
5 Correct 45 ms 94436 KB Output is correct
6 Correct 50 ms 99960 KB Output is correct
7 Correct 64 ms 118548 KB Output is correct
8 Runtime error 177 ms 262144 KB Execution killed with signal 9
9 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 45 ms 94328 KB Output is correct
2 Correct 45 ms 94312 KB Output is correct
3 Correct 46 ms 94304 KB Output is correct
4 Correct 45 ms 94336 KB Output is correct
5 Correct 46 ms 94540 KB Output is correct
6 Correct 49 ms 100044 KB Output is correct
7 Correct 64 ms 118588 KB Output is correct
8 Runtime error 175 ms 262144 KB Execution killed with signal 9
9 Halted 0 ms 0 KB -