Submission #41416

#	Time	Username	Problem	Language	Result	Execution time	Memory
41416		cmaster	Bali Sculptures (APIO15_sculpture)	C++14	16 / 100	1079 ms	11244 KiB

sculpture

#include <bits/stdc++.h>
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>*/
 
#define pb push_back
#define mp make_pair
#define sz(s) ((int)(s.size()))
#define all(s) s.begin(), s.end()
#define rep(i, a, n) for (int i = a; i <= n; ++i)
#define per(i, n, a) for (int i = n; i >= a; --i)
#define onlycin ios_base::sync_with_stdio(false); cin.tie(0) 
#define F first
#define S second
using namespace std;
// using namespace __gnu_pbds;
typedef long long ll;
typedef unsigned long long ull;
/*typedef tree<
pair < int, int >,
null_type,
less< pair < int, int > >,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;*/
// find_by_order() order_of_key()
const int MAXN = (int)5e5+228;
const char nxtl = '\n';
const int mod = (int)1e9+7;
const double eps = (double)1e-7;
template<typename T> inline bool updmin(T &a, const T &b) {return a > b ? a = b, 1 : 0;}
template<typename T> inline bool updmax(T &a, const T &b) {return a < b ? a = b, 1 : 0;}

int n, a[MAXN], l, r;
map < pair < ll, pair < ll, ll > >, ll > dp;

ll rec(int i, ll cost, int cnt) {
	if(i == n+1) {
		if(l <= cnt && cnt <= r) return cost;
		return mod;
	}
	if(dp.count(mp(i, mp(cost, cnt)))) return dp[mp(i, mp(cost, cnt))];
	ll ans = (ll)1e15;
	ll sum = 0;
	rep(j, i, n) {
		sum += a[j];
		ans = min(ans, rec(j+1, cost | sum, cnt+1));
	}
	return dp[mp(i, mp(cost, cnt))] = ans;
}

int main() {
	#ifdef accepted
		freopen(".in", "r", stdin);
		freopen(".out", "w", stdout);
	#endif
	onlycin;
	cin >> n >> l >> r;
	rep(i, 1, n) cin >> a[i];
	cout << rec(1, 0, 0) << nxtl;
	
	return 0;
}

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