Submission #32675

#	Time	Username	Problem	Language	Result	Execution time	Memory
32675		minimario	Bali Sculptures (APIO15_sculpture)	C++14	100 / 100	796 ms	2088 KiB

sculpture

#include <bits/stdc++.h>
using namespace std;

const int MAX = 2005;

typedef long long ll;

int y[MAX];
bool in[50];
int dp[MAX], dp2[105][105]; // is it possible to cut 1..n into k parts
ll p[MAX];

// minimum number of parts that we need to cut 1...i into
// in order to have some kth bit off

vector<int> nesc;
bool works(ll x, int k) {
	for (int i : nesc) {
		if (x & (1LL<<i)) { return false; }
	}
	if (x & (1LL<<k)) { return false; }
	return true;
}

int main() {
	//freopen("a.in", "r", stdin);
	//freopen("a.out", "w", stdout);
	int n, a, b; scanf("%d %d %d", &n, &a, &b);
	for (int i=1; i<=n; i++) {
		scanf("%d", &y[i]);
		p[i] = p[i-1] + (ll)y[i];
	}
	if (a == 1) {
		for (int k=45; k>=0; k--) {
			for (int i=1; i<MAX; i++) { dp[i] = 2005; }
			for (int i=1; i<=n; i++) {
				for (int j=1; j<=i; j++) {
					ll sum = p[i] - p[j-1];
					if (works(sum, k)) {
						dp[i] = min(dp[i], dp[j-1] + 1);
					}
				}
			}
			if (dp[n] <= b) { nesc.push_back(k); }
		}
	}
	else {
		for (int k=45; k>=0; k--) {
			for (int i=0; i<105; i++) { 
				for (int j=0; j<105; j++) {
					dp2[i][j] = false;
				}
			}
			dp2[0][0] = true;
			for (int i=0; i<=n; i++) {
				for (int j=0; j<=i; j++) {
					if (dp2[i][j]) {
						for (int l=i+1; l<=n; l++) {
							ll sum = p[l] - p[i];
							if (works(sum, k)) {
								dp2[l][j+1] = true;
							}
						}
					}
				}
			}
			bool doable = false;
			for (int i=a; i<=b; i++) {
				if (dp2[n][i]) { doable = true; }
			}
			if (doable) { nesc.push_back(k); }
		}
	}
	ll sum = 0;
	for (int i : nesc) { in[i] = true; }
	for (int i=0; i<=45; i++) {
		if (!in[i]) { sum += 1LL<<i; }
	}
	printf("%lld\n", sum);
}

Compilation message (stderr)

sculpture.cpp: In function 'int main()':
sculpture.cpp:28:44: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  int n, a, b; scanf("%d %d %d", &n, &a, &b);
                                            ^
sculpture.cpp:30:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &y[i]);
                     ^

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