oj.uz

Submission #83448

# Submission time Handle Problem Language Result Execution time Memory
83448 2018-11-07T19:52:18 Z Qlukva Bali Sculptures (APIO15_sculpture) C++14
0 / 100
 3 ms 592 KB 
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

const long long INF = 1e15;

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	int n, a, b;
	cin >> n >> a >> b;
	vector<long long> x(n + 1);
	for (int i = 1; i <= n; i++) {
		cin >> x[i];
	}
	vector<vector<long long>> d(b + 1, vector<long long>(n + 1, INF));
	d[0][0] = 0;
	for (int j = 1; j <= b; j++) {
		for (int i = 1; i <= n; i++) {
			long long cur = x[i];
			for (int k = i - 1; k >= 0; k--) {
				d[j][i] = min(d[j][i], (d[j - 1][k] | cur));
				cur += x[k];
			}
		}
	}
	long long ans = INF;
	for (int i = a; i <= b; i++) {
		ans = min(ans, d[i][n]);
	}
	cout << ans << endl;
//	system("pause");
}

Subtask #1
0 / 9.0

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

Subtask #2
0 / 16.0

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

Subtask #5
0 / 29.0

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