Submission #926589

#	Time	Username	Problem	Language	Result	Execution time	Memory
926589		Baizho	Bali Sculptures (APIO15_sculpture)	C++14	100 / 100	106 ms	31568 KiB

sculpture

#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
  
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
 
 #pragma GCC optimize("Ofast,unroll-loops,fast-math")
 #pragma GCC target("popcnt")
 
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> pll;
 
#define sz size()
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define pb push_back
 
const int mod = ll(1e9)+7; //(b + (a%b)) % b (to mod -1%(10^9+7) correctly in c++ its -1 but its suppose to be 10^9+6
const ll MOD = 998244353;  // (a%mod)*(binpow(b,mod-2,mod) = (a/b)%mod
const int N = ll(2e3)+5;
const int M = ll(2e5) + 5;
const long long inf = 1e18;
const long double eps = 1e-15L;
 
ll lcm(ll a, ll b) { return (a / __gcd(a,b))*b; }
 
ll binpow(ll a, ll b, ll m) { ll res=1; a %= m; while(b>0){ if(b&1)res=(res * a) % m; a=(a * a) % m; b/=2; } return res%m;}
 
void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }

int n, a, b, y[N];
long long pref[N];
long long dp[N][N];
long long get(int l, int r) {
	return pref[r] - pref[l - 1];
}

bool check(long long mask) {
	if(a == 1) {
		//prefix i, minimum amount of blocks to divide into
		for(int i = 1; i <= n; i ++) {
			dp[i][0] = 1e18;
			for(int j = 0; j < i; j ++) {
				long long sum = get(j + 1, i);
				if((mask | sum) == mask) dp[i][0] = min(dp[j][0] + 1, dp[i][0]);
			}
		}
		return dp[n][0] <= b;
	} else {
		dp[0][0] = 1;
		for(int i = 1; i <= n; i ++) {
			for(int k = 1; k <= i; k ++) {
				dp[i][k] = 0;
				for(int j = 0; j < i; j ++) {
					long long sum = get(j + 1, i);
					if((mask | sum) == mask) dp[i][k] |= dp[j][k - 1];
				}
			}
		}
		bool ok = 0;
		for(int i = a; i <= b; i ++) ok |= dp[n][i];
		return ok;
	}
}

void Baizho() {
	cin>>n>>a>>b;
	for(int i = 1; i <= n; i ++) {
		cin>>y[i];
		pref[i] = pref[i - 1] + y[i];
	}
	long long mask = (1ll << 62) - 1;
	for(int i = 61; i >= 0; i --) {
		if(check(mask ^ (1ll << i))) {
//			cout<<i<<"\n";
			mask ^= (1ll << i);
		}
	}
	cout<<mask<<"\n";
}
 
signed main() {		
// 	Freopen("nondec");
    ios_base::sync_with_stdio(false);   
    cin.tie(0);cout.tie(0); 
//   	precalc();
   	
    int ttt = 1;
//    cin>>ttt;
 
    for(int i=1; i<=ttt; i++) {Baizho(); }
}

Compilation message (stderr)

sculpture.cpp: In function 'void Freopen(std::string)':
sculpture.cpp:35:34: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                           ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sculpture.cpp:35:76: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                                                                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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