Submission #45005

#	Time	Username	Problem	Language	Result	Execution time	Memory
45005		RezwanArefin01	Bali Sculptures (APIO15_sculpture)	C++17	100 / 100	632 ms	23420 KiB

sculpture

#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

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

typedef long long ll;
typedef pair<int, int> ii; 

int n, A, B, a[2001], f[2010]; ll C[2001][2001]; 
bool dp[110][110];

int main(int argc, char const *argv[]) {
	scanf("%d %d %d", &n, &A, &B); 
	for(int i = 1; i <= n; i++) 
		scanf("%d", &a[i]); 

	for(int i = 1; i <= n; i++) {
		C[i][i] = a[i];
		for(int j = i + 1; j <= n; j++) 
			C[i][j] = C[i][j - 1] + a[j]; 
	}

	ll mask = (1ll << 42) - 1; 
	#define nyc(a, b) ((a & b) == a)
	if(A == 1) {
		for(int b = 41; b >= 0; b--) {
			mask ^= 1ll << b; 
			f[0] = 0;
			for(int i = 1; i <= n; i++) { f[i] = B + 1; 
				for(int j = 1; j <= i; j++) 
					if(nyc(C[j][i], mask)) 
						f[i] = min(f[i], f[j - 1] + 1);
			}
			if(f[n] > B) mask ^= 1ll << b;
		}
	} else {
		for(int b = 41; b >= 0; b--) {
			mask ^= 1ll << b; 
			for(int i = 1; i <= n; i++) 
				dp[1][i] = nyc(C[1][i], mask);
			for(int k = 2; k <= B; k++) {
				for(int i = 1; i <= n; i++) { dp[k][i] = 0;
					for(int j = 1; j < i; j++) 
						dp[k][i] |= (dp[k - 1][j] & nyc(C[j + 1][i], mask));  
				}
			} 
			bool f = 0;
			for(int i = A; i <= B; i++) if(dp[i][n]) f = 1; 
			if(!f) mask ^= 1ll << b;
		}
	}  printf("%lld\n", mask);
}

Compilation message (stderr)

sculpture.cpp: In function 'int main(int, const char**)':
sculpture.cpp:14:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d %d", &n, &A, &B); 
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
sculpture.cpp:16:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &a[i]); 
   ~~~~~^~~~~~~~~~~~~

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