제출 #248779

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
248779		sahil_k	Bali Sculptures (APIO15_sculpture)	C++14	16 / 100	20 ms	1536 KiB

sculpture

#include <iostream>
using namespace std;
int n, a, b;
int cost[2100];
bool dp[60][30][600];
int main () {
	cin >> n >> a >> b;
	for (int i=1; i<=n; i++) {
		cin >> cost[i];
	}
	cost[0] = 0;
	dp[0][0][0] = true;
	for (int i=1; i<=n; i++) {
		for (int j=1; j<=b; j++) {
			int cursum = cost[i];
			for (int k=i-1; k>=0; k--) {
				for (int l=0; l<600; l++) {
					if (dp[k][j-1][l]) dp[i][j][l|cursum] = true;
				}
				cursum += cost[k];
			}
		}
	}
	int ans = 1e9;
	for (int i=a; i<=b; i++) {
		for (int j=0; j<600; j++) {
			if (dp[n][i][j]) {
				ans = min(ans, j);
				if (j == 9) cout << i << endl;
			}
		}
	}
	cout << ans << endl;
}
/*
6 1 3
8 1 2 1 5 4
*/

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