Submission #1208324

#	Time	Username	Problem	Language	Result	Execution time	Memory
1208324		ssafarov	Bali Sculptures (APIO15_sculpture)	C++20	71 / 100	1092 ms	840 KiB

sculpture

#define Magic ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long long double
#define en '\n'
#define tsts int tetss; cin >> tetss; while(tetss--)
#define all(a) a.begin() , a.end()
#define pb push_back
#define ld long long double
#define fi first
#define se second
ll INF = 1e18;
const int N = 2e6 + 1;
const int mod = 1e9 + 7;
using namespace std;
using namespace __gnu_pbds;
 
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
 
template <typename T>
using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>; 
 
// order_of_key(n) - The number of items in a set that are strictly smaller than k
// find_by_order(k) - It returns an iterator to the ith largest element
 
ll lcm(ll a, ll b)
{
  ll gc = __gcd(a, b);
  return   a / gc * b;
}
 
ll binpow (ll a, ll n) {
  if (n == 0)
    return 1;
  if (n % 2 == 1)
    return binpow (a, n-1) * a;
  else {
    ll b = binpow (a, n/2);
    return b * b;
  }
}
 
 
ll binpow_mod(ll a, ll b, ll md)
{
    ll res = 1;
    a = a % md;
    while (b > 0)
    {
        if (b & 1)
            res = (res * a) % md;
        a = (a * a) % md;
        b >>= 1;
    }
    return res;
}
 
ll in() {ll x; cin >> x; return x;};
 
ll gcd (ll a, ll b, ll & x, ll & y) {
	if (a == 0) {
		x = 0; y = 1;
		return b;
	}
	ll x1, y1;
	ll d = gcd (b%a, a, x1, y1);
	x = y1 - (b / a) * x1;
	y = x1;
	return d;
}
 
ll gcdinv(ll a, ll b){
	ll x, y;
	gcd(a, b, x, y);
	return x;
}
 
ll eql(ll x, ll y, bool ok){
	if(ok) return x;
	else return y;
}
 
// -------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- чё

void solve(){
	ll n, a, b; cin >> n >> a >> b;
	ll m[n+12];
	for(ll i = 1; i <= n; ++i) cin >> m[i];
	ll fans = 0;
	for(ll s = 60; s >= 0; --s){
		ll x = (1ll << s);
		ll dp[n+12][b+12];
		for(ll i = 0; i <= n; ++i){
			for(ll j = 0; j <= b; ++j) dp[i][j] = 0;
		}
		dp[0][0] = 1;
		for(ll i = 1; i <= n; ++i){
			for(ll j = 1; j <= b; ++j){
				ll sum = 0;
				for(ll x = i - 1; x >= 0; --x){
					sum += m[x + 1];
					ll zv = (sum >> s);
					ll tz = (fans >> s);
					if((zv | tz) != tz) continue;
					dp[i][j] = max(dp[i][j], dp[x][j - 1]);
				}
			}
		}
		bool ok = 0;
		for(ll j = a; j <= b; ++j){
			if(dp[n][j]) ok = 1;
		}
		if(!ok){
			fans += x;
		}
	}
	cout << fans;
}

int main(){
	// freopen("fairphoto.in", "r", stdin); freopen("fairphoto.out", "w", stdout);
	Magic
	// tsts{
		solve();
		cout << endl;
	// }
}

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