Submission #435222

#	Time	Username	Problem	Language	Result	Execution time	Memory
435222		sinamhdv	Bali Sculptures (APIO15_sculpture)	C++11	71 / 100	62 ms	460 KiB

sculpture

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

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int mod = 1000 * 1000 * 1000 + 7;
const int INF = 1e9 + 100;
const ll LINF = 1e18 + 100;

#ifdef DEBUG
#define dbg(x) cout << #x << " = " << (x) << endl << flush;
#define dbgr(s, f) { cout << #s << ": "; for (auto _ = (s); _ != (f); _++) cout << *_ << ' '; cout << endl << flush; }
#else
#define dbg(x) ;
#define dbgr(s, f) ;
#endif
#define FOR(i, a, b) for (int i = (a); i < (int)(b); i++)
#define fast_io ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
#define endl '\n'

#define MAXN 110
#define LOGN 43

int n, A, B, a[MAXN];
bool dp[MAXN][MAXN];
ll ps[MAXN];

int32_t main(void)
{
	fast_io;
	cin >> n >> A >> B;
	FOR(i, 1, n + 1) cin >> a[i], ps[i] = ps[i - 1] + a[i];

	ll mask = 0;
	for (int b = LOGN - 1; b >= 0; b--)
	{
		memset(dp, 0, sizeof(dp));
		dp[0][0] = 1;
		FOR(k, 1, n + 1)
		{
			FOR(i, 1, n + 1)
			{
				FOR(j, 0, i)
				{
					ll sm = (ps[i] - ps[j]) & (~((1ll << b) - 1));
					if ((sm | mask) != mask) continue;
					dp[k][i] |= dp[k - 1][j];
				}
			}
		}
		bool ok = false;
		FOR(i, A, B + 1) ok |= dp[i][n];
		if (!ok) mask |= (1ll << b);
	}

	cout << mask << endl;

	return 0;
}

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