oj.uz

Submission #26226

# Submission time Handle Problem Language Result Execution time Memory
26226 2017-06-28T12:17:48 Z szawinis Bali Sculptures (APIO15_sculpture) C++14
0 / 100
 0 ms 33484 KB 
#include <bits/stdc++.h>
using namespace std;
const int N = 2001;
const long long INF = 1e18;

int n, a, b, p[N];
long long ans = INF, sum[N], dp[N][N];
int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> n >> a >> b;
	for(int i = 1; i <= n; i++) cin >> p[i], sum[i] = sum[i-1] + p[i];
	for(int i = 0; i <= n; i++) for(int j = 0; j <= n; j++) dp[i][j] = INF;
	dp[0][0] = 0;
	for(int i = 1; i <= n; i++) for(int j = 1; j <= i; j++) {
		for(int k = 0; k < i; k++) dp[i][j] = min(dp[k][j-1] | (sum[i] - sum[k]), dp[i][j]);
	}
	for(int i = a; i <= b; i++) ans = min(dp[n][i], ans);
	cout << ans;
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 33484 KB Output is correct
2 Incorrect 0 ms 33484 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 33484 KB Output is correct
2 Incorrect 0 ms 33484 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 33484 KB Output is correct
2 Incorrect 0 ms 33484 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 33484 KB Output is correct
2 Incorrect 0 ms 33484 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 33484 KB Output is correct
2 Incorrect 0 ms 33484 KB Output isn't correct
3 Halted 0 ms 0 KB -