Submission #446252

#	Time	Username	Problem	Language	Result	Execution time	Memory
446252		kym	Bali Sculptures (APIO15_sculpture)	C++14	50 / 100	595 ms	452 KiB

sculpture

#include <bits/stdc++.h>
using namespace std;
#define int ll 
#define FOR(i,s,e) for(ll i = s; i <= (ll)e; ++i)
#define DEC(i,s,e) for(ll i = s; i >= (ll)e; --i)
#define IAMSPEED ios_base::sync_with_stdio(false); cin.tie(0);
#ifdef LOCAL
#define db(x) cerr << #x << "=" << x << "\n"
#define db2(x, y) cerr << #x << "=" << x << " , " << #y << "=" << y << "\n"
#define db3(a,b,c) cerr<<#a<<"="<<a<<","<<#b<<"="<<b<<","<<#c<<"="<<c<<"\n"
#define dbv(v) cerr << #v << ":"; for (auto ite : v) cerr << ite << ' '; cerr <<"\n"
#define dbvp(v) cerr << #v << ":"; for (auto ite : v) cerr << "{"  << ite.f << ',' << ite.s << "} "; cerr << "\n"
#define dba(a,ss,ee) cerr << #a << ":"; FOR(ite,ss,ee) cerr << a[ite] << ' '; cerr << "\n"
#define reach cerr << "LINE: " << __LINE__ << "\n";
#else
#define db(x)
#define db2(x,y)
#define db3(a,b,c)
#define dbv(v)
#define dbvp(v)
#define dba(a,ss,ee)
#define reach 
#endif
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define ll long long 
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define f first
#define s second
#define g0(x) get<0>(x)
#define g1(x) get<1>(x)
#define g2(x) get<2>(x)
#define g3(x) get<3>(x)
typedef pair <ll, ll> pi;
typedef tuple<ll,ll,ll> ti3;
typedef tuple<ll,ll,ll,ll> ti4;
ll rand(ll a, ll b) { return a + rng() % (b-a+1); }
const int MOD = 1e9 + 7;
const int inf = (int)1e9 + 500;
const long long oo = (ll)1e18 + 500;
template <typename T> bool chmax(T& a, const T b) { return a<b ? a = b, 1 : 0; }
template <typename T> bool chmin(T& a, const T b) { return a>b ? a = b, 1 : 0; }
const int MAXN = -1;
int n,a,b;
int dp[2005], A[2005];
int sum[2005];
int rsq(int x, int y) { return sum[y] - sum[x-1]; }
//dp[index][groups] but we ABUSE it to store the minimum groups to get to index
int32_t main() 
{
	IAMSPEED
	cin >> n >> a >> b;
	FOR(i,1,n) cin>> A[i];
	FOR(i,1,n) sum[i] = sum[i-1] + A[i];
	vector<int> disabled;
	int ans = 0;
	DEC(bit,42,0) {
		//db(bit);
		disabled.pb(bit);
		FOR(i,0,n)dp[i]=inf;
		dp[0] = 0;
		FOR(i,1,n) {
			FOR(j,0,i-1) {
				int s=rsq(j+1,i);
				//db(s);
				for(auto b:disabled) {
					//db(b);
					if(s&(1ll<<b))goto riedusg;
				}
				//db(s);
				chmin(dp[i], dp[j]+1);
				riedusg:;
			}
			
			
		//dba(dp,0,n);
		}
		if(dp[n] > b) {
			ans|=(1ll<<bit);
			disabled.pop_back();
		}
	}
	cout << ans;
}

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