제출 #443528

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
443528		arwaeystoamneg	Bali Sculptures (APIO15_sculpture)	C++17	0 / 100	1 ms	332 KiB

sculpture

// EXPLOSION!
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include<chrono>

using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpi;
typedef vector<pair<ll, ll>> vpll;

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

#define pb push_back
#define mp make_pair
#define rsz resize
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define f first
#define s second
#define cont continue
#define endl '\n'
//#define ednl '\n'
#define test int testc;cin>>testc;while(testc--)
#define pr(a, b) trav(x,a)cerr << x << b; cerr << endl;
#define message cout << "Hello World" << endl;
const int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 }; // for every grid problem!!
const ll linf = 4000000000000000000LL;
const ll inf = 998244353;//    1000000007

void pv(vi a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vll a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vector<vi>a) {
	F0R(i, sz(a)) { cout << i << endl; pv(a[i]); cout << endl; }
}void pv(vector<vll>a) { F0R(i, sz(a)) { cout << i << endl; pv(a[i]); }cout << endl; }void pv(vector<string>a) { trav(x, a)cout << x << endl; cout << endl; }
void setIO(string s) {
	ios_base::sync_with_stdio(0); cin.tie(0);
#ifdef arwaeystoamneg
	if (sz(s))
	{
		freopen((s + ".in").c_str(), "r", stdin);
		if (s != "test1")
			freopen((s + ".out").c_str(), "w", stdout);
	}
#endif
}
int n, a, b;
vi c;
// is it possible to partition the sculptures so that the or is a submask of ans?
bool solve(ll ans)
{
	// the minimum amount to partition [1,i]
	vi dp(n + 1, inf);
	dp[0] = 1;
	F0R(i, n)
	{
		ll sum = 0;
		FOR(j, i, n)
		{
			sum += c[j];
			if ((ans - sum) == (ans ^ sum))
			{
				dp[j + 1] = min(dp[j + 1], dp[i] + 1);
			}
		}
	}
	return dp[n] <= b;
}
int main()
{
	setIO("test1");
	cin >> n >> a >> b;
	c.rsz(n);
	trav(x, c)cin >> x;
	ll ans = (1LL << 50) - 1;
	R0F(i, 50)
	{
		ans ^= (1LL << i);
		if (!solve(ans))
			ans ^= (1LL << i);
	}
	cout << ans << endl;
}

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