Submission #400667

#	Time	Username	Problem	Language	Result	Execution time	Memory
400667		BERNARB01	Bali Sculptures (APIO15_sculpture)	C++17	46 / 100	12 ms	8908 KiB

sculpture

#include <bits/stdc++.h>
 
using namespace std;
 
const int N = (int) 103;
const long long inf = (long long) 4e18;
 
int n, a, b, y[N];
long long dp[N][N][N];
long long Dp[2003][2003];

long long sol0(int i, long long run, int stage, long long sum = 0) {
	if (i == n) {
		if (a <= stage && stage <= b) {
			return run | sum;
		}
		return inf;
	}
	long long ret; //dp[i][stage][run];
	//if (ret != -1) {
		//return ret;
	//}
	sum += y[i];
	ret = sol0(i + 1, run, stage, sum);
	if (stage + 1 <= b && i + 1 < n) {
		ret = min(ret, sol0(i + 1, run | sum, stage + 1));
	}
	return ret;
}

long long sol(int i, int j, int stage, long long sum = 0) {
	if (i == n) {
		if (a <= stage && stage <= b) {
			return sum;
		}
		return inf;
	}
	long long& ret = dp[i][j][stage];
	if (ret != -1) {
		return ret;
	}
	sum += y[i];
	ret = sol(i + 1, j, stage, sum);
	if (stage + 1 <= b && i + 1 < n) {
		ret = min(ret, sum | sol(i + 1, i + 1, stage + 1));
	}
	return ret;
}
 
long long sol2(int i, int stage, int j = 0, long long sum = 0) {
	if (i == n) {
		return (a <= stage && stage <= b ? sum : inf);
	}
	long long& ret = Dp[i][j];
	if (ret != -1) {
		return ret;
	}
	sum += y[i];
	ret = sol2(i + 1, stage, j, sum);
	if (i + 1 < n && stage + 1 <= b) {
		ret = min(ret, sum | sol2(i + 1, stage + 1, i + 1));
	}
	return ret;
}

template<const int A>
struct Trie {
	int id;
	vector<array<int, A>> T;
	Trie() {
		id = 2;
		T.assign(64 * 2003, {});
	}
	void inserT(const long long& x) {
		int cr = 0;
		for (int i = 61; i >= 0; i--) {
			int B = !!((1 << i) & x);
			if (!T[cr][B]) {
				T[cr][B] = id++;
			}
			cr = T[cr][B];
		}
	}
	long long querT(const long long& x) {
		int cr = 0;
		long long ans = 0;
		for (int i = 61; i >= 0; i--) {
			int B = !!((1 << i) & x);
			if (T[cr][B]) {
				cr = T[cr][B];
			} else {
				cr = T[cr][B];
				ans |= (1 << i);
			}
		}
		return ans;
	}
};

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> n >> a >> b;
	for (int i = 0; i < n; i++) {
		cin >> y[i];
	}
	memset(dp, -1, sizeof dp);
	if (n <= 20) {
		cout << sol0(0, 0, 1) << '\n';
	} else if (n <= 100) {
		cout << sol(0, 0, 1) << '\n';
	} else {
		long long sum = 0;
		for (int i = 0; i < n; i++) {
			sum += y[i];
		}
		long long res = sum;
		long long summ = 0;
		for (int i = n - 1; i >= 0; i--) {
			sum -= y[i];
			summ += y[i];
			res = min(res, sum | summ);
		}
		vector<Trie<2>> t(b);
		vector<vector<long long>> DP(n, vector<long long>(b, inf));
		DP[0][0] = y[0];
		t[0].inserT(DP[0][0]);
		for (int i = 0; i < b; i++) {
			t[i].inserT(inf);
		}
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < min(b, i + 1); j++) {
				DP[i][j] = t[j - 1].querT(y[i]);
			}
			for (int j = 0; j < min(b, i + 1); j++) {
				t[j].inserT(DP[i][j]);
			}
		}
		res = min(res, *min_element(DP[n - 1].begin(), DP[n - 1].end()));
		cout << min(res, sol2(0, 1)) << '\n';
	}
	return 0;
}

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