제출 #83451

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
83451		Qlukva	Bali Sculptures (APIO15_sculpture)	C++14	71 / 100	1082 ms	13180 KiB

sculpture

#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
using namespace std;

const long long INF = 1e15;
const int MAX = 70;

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<set<long long>>> d(b + 1, vector<set<long long>>(n + 1));
	d[0][0].insert(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--) {
				for (auto &x : d[j - 1][k]) {
					d[j][i].insert(cur | x);
				}
				while (d[j][i].size() > MAX) {
					d[j][i].erase(--d[j][i].end());
				}
				cur += x[k];
			}
		}
	}
	long long ans = INF;
	for (int i = a; i <= b; i++) {
		ans = min(ans, *d[i][n].begin());
	}
	cout << ans << endl;
//	system("pause");
}

• Subtask 1: 9 / 9
• Subtask 2: 16 / 16
• Subtask 3: 21 / 21
• Subtask 4: 25 / 25
• Subtask 5: 0 / 29