Submission #995200

#	Time	Username	Problem	Language	Result	Execution time	Memory
995200		dreamboy	Bali Sculptures (APIO15_sculpture)	C++17	9 / 100	61 ms	604 KiB

sculpture

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
//using namespace __gnu_pbds;

#define speed ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define russian setlocale(LC_ALL,"Russian_Russia.20866");
#define file freopen("onlyone.in", "r", stdin), freopen("onlyone.out", "w", stdout);
#define ll long long
#define ull unsigned long long
#define ld long double
#define pll pair<ll, ll>
#define pii pair<int, int>
#define all(s) s.begin(), s.end()
#define pb push_back
#define ins insert
#define mp make_pair
#define sz(x) x.size()
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define mem(x) memset(x, 0, sizeof(x))
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const ll N = 2010;
const ll M = 600000;
const ll block = 316;
const ll mod = 998244353;
const ll P = 263;
const ld pi = acos(-1);
const ll inf = 1e9;

ll add(ll a, ll b) {
    if(a + b < 0) return a + b + mod;
    if(a + b >= mod) return a + b - mod;
    return a + b;
}

ll sub(ll a, ll b) {
    return (a - b + mod) % mod;
}

ll mul(ll a, ll b) {
    return a * 1LL * b % mod;
}

ll binpow(ll a, ll n) {
    ll res = 1LL;
    while(n) {
        if(n & 1) res = mul(res, a); // if(n % 2 == 1)
        a = mul(a, a);
        n >>= 1; //n / 2
    }
    return res;
}

ll inv(ll x) {//число х в степени -1
    return binpow(x, mod - 2);
}
ll n, a, b;
ll y[N], pref[N];
void sub1() {
    ll ans = 2e12;
    for(ll mask = 0; mask < (1LL << n); mask++) {
        ll col1 = __builtin_popcount(mask);
        if(a <= col1 && col1 <= b) {
            ll sum = 0, cur = 0;
            for(ll i = 0; i < n; i++) {
                sum += y[i + 1];
                if((mask & (1LL << i))) {
                    cur |= sum;
                    sum = 0LL;
                }
            }
            if(!sum) ans = min(ans, cur);
        }
    }
    cout << ans << '\n';
}
void solve() {
    cin >> n >> a >> b;
    for(ll i = 1; i <= n; i++) {
        cin >> y[i];
        pref[i] = pref[i - 1] + y[i];
    }
    if(n <= 20) {
        sub1();
        return;
    }
}
signed main() {
    speed;
    //file;
    int test = 1;
    //cin >> test;
    while(test--) {
        solve();
    }
}

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